Radius of a graph
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
radius(graph, mode = c("all", "out", "in", "total"))graph |
The input graph, it can be directed or undirected. |
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.
A numeric scalar, the radius of the graph.
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
eccentricity for the underlying
calculations, codedistances for general shortest path
calculations.
g <- make_star(10, mode="undirected") eccentricity(g) radius(g)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.