...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
dijkstra_visitor<EventVisitorList>
boost::dijkstra_shortest_paths (G, vertex(a, G), distance_map(make_iterator_property_map(distance.begin(), vertex_id, distance[0])). predecessor_map(make_iterator_property_map(parent.begin(), vertex_id, parent[0])). visitor(make_dijkstra_visitor(copy_graph(G_copy, on_examine_edge()))));
Parameter | Description | Default |
---|---|---|
EventVisitorList | A list of EventVisitor's created with std::pair. | null_visitor |
boost/graph/dijkstra_shortest_paths.hpp
Function | Description |
---|---|
template <class EventVisitorList> dijkstra_visitor<EventVisitorList> make_dijkstra_visitor(EventVisitorList ev_list); | Returns the event visitor list adapted to be a Dijkstra Visitor. |
The following are event visitors: predecessor_recorder,
distance_recorder
time_stamper,
and property_writer.
Copyright © 2000-2001 |
Jeremy Siek,
Indiana University (jsiek@osl.iu.edu) Lie-Quan Lee, Indiana University (llee@cs.indiana.edu) Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) |