average.path.length {igraph} | R Documentation |
Shortest (directed or undirected) paths between vertices
Description
average.path.length()
was renamed to mean_distance()
to create a more
consistent API.
Usage
average.path.length(
graph,
weights = NULL,
directed = TRUE,
unconnected = TRUE,
details = FALSE
)
Arguments
graph |
The graph to work on. |
weights |
Possibly a numeric vector giving edge weights. If this is
|
directed |
Whether to consider directed paths in directed graphs, this argument is ignored for undirected graphs. |
unconnected |
What to do if the graph is unconnected (not strongly connected if directed paths are considered). If TRUE, only the lengths of the existing paths are considered and averaged; if FALSE, the length of the missing paths are considered as having infinite length, making the mean distance infinite as well. |
details |
Whether to provide additional details in the result.
Functions accepting this argument (like |