The eccentricity of a vertex is its distance from the farthest other node in the graph. The smallest eccentricity in a graph is called its radius.
radius(graph, ..., weights = NULL, mode = c("all", "out", "in", "total"))The input graph, it can be directed or undirected.
These dots are for future extensions and must be empty.
Possibly a numeric vector giving edge weights. If this is
NULL and the graph has a weight edge attribute, then the
attribute is used. If this is NA then no weights are used (even if
the graph has a weight attribute). In a weighted graph, the length
of a path is the sum of the weights of its constituent edges.
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 considered. If all, the default, then the graph is treated
as undirected, i.e. edge directions are not taken into account. This
argument is ignored for undirected graphs.
A numeric scalar, the radius of the graph.
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. Isolated vertices have eccentricity zero.
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
eccentricity() for the underlying
calculations, distances for general shortest path
calculations.
Other paths:
all_simple_paths(),
diameter(),
distance_table(),
eccentricity(),
graph_center()
g <- make_star(10, mode = "undirected")
eccentricity(g)
#> [1] 1 2 2 2 2 2 2 2 2 2
radius(g)
#> [1] 1