convert a dijkstra.sp predecessor structure into the path joining two nodes
determine a path between two nodes in a graph,
using output of dijkstra.sp.
extractPath(s, f, pens)
s |
index of starting node in nodes vector
of the graph from which |
f |
index of ending node in nodes vector |
pens |
predecessor index vector as returned
in the |
numeric vector of indices of nodes along shortest path
Vince Carey <stvjc@channing.harvard.edu>
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
data(FileDep) dd <- dijkstra.sp(FileDep) extractPath(1,9,dd$pen)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.