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
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
out then the shortest paths from the vertex, if
in then to it will be c
Value
eccentricity returns a numeric vector, containing the
eccentricity score of each given vertex.
radius returns a numeric scalar.
concept
Eccentricity
Radius
Details
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.
References
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.