Boost Graph Library: dijkstra

dijkstra_visitor<EventVisitorList>

This class is an adapter that converts a list of EventVisitor's (constructed using std::pair) into a DijkstraVisitor.

Example

This is an excerpt from examples/dijkstra.cpp where the predecessor_recorder single-event visitor is used to record the shortest-paths search-tree calculated by Dijkstra's algorithm.

  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()))));

Model of

Dijkstra Visitor

Template Parameters

Parameter Description Default

EventVisitorList A list of EventVisitor's created with std::pair. null_visitor

Parameter	Description	Default
`EventVisitorList`	A list of EventVisitor's created with `std::pair`.	`null_visitor`

Where Defined

boost/graph/dijkstra_shortest_paths.hpp

Member Functions

This class implements all of the member functions required by DijkstraVisitor. In each function the appropriate event is dispatched to the EventVisitor's in the EventVisitorList.

Non-Member Functions

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.