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 |
Jeremy Siek,
Univ.of Notre Dame (jsiek@lsc.nd.edu) Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu) Andrew Lumsdaine, Univ.of Notre Dame (lums@lsc.nd.edu) |