EVOLUTION-MANAGER
Edit File: eccentricity.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Eccentricity of the vertices in a graph</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for eccentricity {igraph}"><tr><td>eccentricity {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Eccentricity of the vertices in a graph</h2> <h3>Description</h3> <p>The eccentricity of a vertex is its shortest path distance from the farthest other node in the graph. </p> <h3>Usage</h3> <pre> eccentricity(graph, vids = V(graph), mode = c("all", "out", "in", "total")) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph, it can be directed or undirected.</p> </td></tr> <tr valign="top"><td><code>vids</code></td> <td> <p>The vertices for which the eccentricity is calculated.</p> </td></tr> <tr valign="top"><td><code>mode</code></td> <td> <p>Character constant, gives whether the shortest paths to or from the given vertices should be calculated for directed graphs. If <code>out</code> then the shortest paths <em>from</em> the vertex, if <code>in</code> then <em>to</em> it will be considered. If <code>all</code>, the default, then the corresponding undirected graph will be used, edge directions will be ignored. This argument is ignored for undirected graphs.</p> </td></tr> </table> <h3>Details</h3> <p>The eccentricity of a vertex is calculated by measuring the shortest distance from (or to) the vertex, to (or from) all vertices in the graph, and taking the maximum. </p> <p>This implementation ignores vertex pairs that are in different components. Isolate vertices have eccentricity zero. </p> <h3>Value</h3> <p><code>eccentricity</code> returns a numeric vector, containing the eccentricity score of each given vertex. </p> <h3>References</h3> <p>Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994. </p> <h3>See Also</h3> <p><code><a href="radius.html">radius</a></code> for a related concept, <code><a href="distances.html">distances</a></code> for general shortest path calculations. </p> <h3>Examples</h3> <pre> g <- make_star(10, mode="undirected") eccentricity(g) </pre> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>