get.all.shortest.paths {igraph} | R Documentation |
Shortest (directed or undirected) paths between vertices
Description
get.all.shortest.paths()
was renamed to all_shortest_paths()
to create a more
consistent API.
Usage
get.all.shortest.paths(
graph,
from,
to = V(graph),
mode = c("out", "all", "in"),
weights = NULL
)
Arguments
graph |
The graph to work on. |
from |
Numeric constant, the vertex from or to the shortest paths will be calculated. Note that right now this is not a vector of vertex ids, but only a single vertex. |
to |
Numeric vector, the vertices to which the shortest paths will be
calculated. By default it includes all vertices. Note that for
|
mode |
Character constant, gives whether the shortest paths to or from
the given vertices should be calculated for directed graphs. If |
weights |
Possibly a numeric vector giving edge weights. If this is
|