template<typename GraphTraits, typename Path_t>
class shortest_paths< GraphTraits, Path_t >
A record of the shortest path for each node relative to a special
"given node", either:
SPS_FROM_GIVEN_ORIGIN:
from the given origin node to each node in a graph, or
SPS_TO_GIVEN_TARGET:
from each node in a graph to the given target node.
The constructor runs Dijkstra's algorithm, and the results are
stored in this class.
template<typename GraphTraits, typename Path_t>
shortest_paths's constructor.
Use Dijkstra's algorithm relative to GIVEN_NODE to populate m_dist and
m_best_edge with enough information to be able to generate Path_t instances
to give the shortest path...
SPS_FROM_GIVEN_ORIGIN: to each node in a graph from the origin node, or
SPS_TO_GIVEN_TARGET: from each node in a graph to the target node.
References FOR_EACH_VEC_ELT, gcc_assert, i, INT_MAX, m_best_edge, m_dist, m_graph, m_sense, NULL, queue, and SPS_FROM_GIVEN_ORIGIN.
template<typename GraphTraits, typename Path_t>
Generate an Path_t instance giving the shortest path between OTHER_NODE
and the given node.
SPS_FROM_GIVEN_ORIGIN: shortest path from given origin node to OTHER_NODE
SPS_TO_GIVEN_TARGET: shortest path from OTHER_NODE to given target node.
If no such path exists, return an empty path.
References m_best_edge, m_sense, and SPS_FROM_GIVEN_ORIGIN.