dijkstra_visitor<EventVisitorList>
std::vector<Vertex> p(num_vertices(G)); std::vector<int> d(num_vertices(G)); Vertex s = *(vertices(G).first); dijkstra_shortest_paths(G, s, distance_map(&d[0]). visitor(make_dijkstra_visitor(record_predecessors(&p[0], on_edge_relaxed()))));
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) |