extractPath: convert a dijkstra.sp predecessor structure into the path...

Description Usage Arguments Value Author(s) References See Also Examples

View source: R/interfaces.R

Description

determine a path between two nodes in a graph, using output of dijkstra.sp.

Usage

1
extractPath(s, f, pens)

Arguments

s

index of starting node in nodes vector of the graph from which pens was derived

f

index of ending node in nodes vector

pens

predecessor index vector as returned in the preds component of dijkstra.sp output

Value

numeric vector of indices of nodes along shortest path

Author(s)

Vince Carey <stvjc@channing.harvard.edu>

References

Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8

See Also

allShortestPaths

Examples

1
2
3

RBGL documentation built on Nov. 8, 2020, 5 p.m.