radius {igraph} | R Documentation |
Radius of a graph
Description
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.
Usage
radius(graph, ..., weights = NULL, mode = c("all", "out", "in", "total"))
Arguments
graph |
The input graph, it can be directed or undirected. |
... |
These dots are for future extensions and must be empty. |
weights |
Possibly a numeric vector giving edge weights. If this is
|
mode |
Character constant, gives whether the shortest paths to or from
the given vertices should be calculated for directed graphs. If |
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. Isolated vertices have eccentricity zero.
Value
A numeric scalar, the radius of the graph.
Related documentation in the C library
References
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
See Also
eccentricity()
for the underlying
calculations, distances for general shortest path
calculations.
Other paths:
all_simple_paths()
,
diameter()
,
distance_table()
,
eccentricity()
,
graph_center()
Examples
g <- make_star(10, mode = "undirected")
eccentricity(g)
radius(g)