andres::graph
|
Idle visitor for Dijkstra's algorithm. More...
#include <shortest-paths.hxx>
Public Types | |
typedef DISTANCE_ITERATOR | Distances |
typedef PARENT_ITERATOR | Parents |
Public Member Functions | |
bool | operator() (Distances, Parents, const std::size_t) const |
bool | operator() (Distances, Parents, Parents, const std::size_t) const |
Idle visitor for Dijkstra's algorithm.
Definition at line 878 of file shortest-paths.hxx.
typedef DISTANCE_ITERATOR andres::graph::DijkstraIdleVisitor< DISTANCE_ITERATOR, PARENT_ITERATOR >::Distances |
Definition at line 879 of file shortest-paths.hxx.
typedef PARENT_ITERATOR andres::graph::DijkstraIdleVisitor< DISTANCE_ITERATOR, PARENT_ITERATOR >::Parents |
Definition at line 880 of file shortest-paths.hxx.
|
inline |
Definition at line 882 of file shortest-paths.hxx.
|
inline |
Definition at line 884 of file shortest-paths.hxx.