| eccentricity {igraph} | R Documentation |
The eccentricity of a vertex is its shortest path distance from the farthest other node in the graph. The smallest eccentricity in a graph is called its radius
eccentricity(graph, vids=V(graph), mode=c("all", "out", "in", "total"))
radius(graph, mode=c("all", "out", "in", "total"))
graph |
The input graph, it can be directed or undirected. |
vids |
The vertices for which the eccentricity is calculated. |
mode |
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.
radius returns a numeric scalar.
Gabor Csardi csardi.gabor@gmail.com
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
shortest.paths for general shortest path
calculations.
g <- graph.star(10, mode="undirected") eccentricity(g) radius(g)