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
A vector of indices
. For example, if the
element one of this vector has value
10, that means that the
predecessor of node
1 is node
10. The next predecessor is
found by examining
The start node that was supplied in the call to
VJ Carey <firstname.lastname@example.org>
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
1 2 3 4 5 6 7 8 9 10
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.