The eccentricity of a vertex is its shortest path distance from the farthest other node in the graph.
eccentricity(graph, vids = V(graph), mode = c("all", "out", "in", "total"))
The input graph, it can be directed or undirected.
The vertices for which the eccentricity is calculated.
Character constant, gives whether the shortest paths to or from
the given vertices should be calculated for directed graphs. If
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.
This implementation ignores vertex pairs that are in different components. Isolate vertices have eccentricity zero.
eccentricity returns a numeric vector, containing the
eccentricity score of each given vertex.
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
radius for a related concept,
distances for general shortest path calculations.
g <- make_star(10, mode="undirected") eccentricity(g)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.