Dijkstra's shortest paths using boost C++
dijkstra's shortest paths
- instance of class graph
- character: node name for start of path
- numeric: edge weights.
These functions are interfaces to the Boost graph library C++ routines for Dijkstra's shortest paths.
For some graph subclasses, computing the edge weights can be expensive.
If you are calling
dijkstra.sp in a loop, you can pass the edge
weights explicitly to avoid the edge weight creation cost.
A list with elements:
- The vector of distances from
startto each node of
Infwhen there is no path from
- A vector of indices
nodes(g)) of predecessors corresponding to each node on the path from that node back to
. For example, if the
element one of this vector has value
- The start node that was supplied in the call to
10, that means that the predecessor of node
10. The next predecessor is found by examining
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
con1 <- file(system.file("XML/dijkex.gxl",package="RBGL"), open="r") dd <- fromGXL(con1) close(con1) dijkstra.sp(dd) dijkstra.sp(dd,nodes(dd)) con2 <- file(system.file("XML/ospf.gxl",package="RBGL"), open="r") ospf <- fromGXL(con2) close(con2) dijkstra.sp(ospf,nodes(ospf))