bfs_visitor<EventVisitorList>
// Construct graph G and obtain the source vertex s ... boost::breadth_first_search(G, s, make_bfs_visitor( std::make_pair(boost::record_distances(d, boost::on_tree_edge()), std::make_pair(boost::record_predecessors(p.begin(), boost::on_tree_edge()), copy_graph(G_copy, boost::on_examine_edge())))) );
Parameter | Description | Default |
---|---|---|
EventVisitorList | A list of EventVisitor's created with std::pair. | null_visitor |
boost/graph/breadth_first_search.hpp
Function | Description |
---|---|
template <class EventVisitorList> bfs_visitor<EventVisitorList> make_bfs_visitor(EventVisitorList ev_list); | Returns the event visitor list adapted to be a BFS 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) |