boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-11 21:34:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

discover_vertex -> examine_vertex

Browse Source 
[SVN r8634]
This commit is contained in:
Jeremy Siek 2001-01-18 04:04:58 +00:00
parent 77e8a3261b
commit f85a60382b
1 changed files with 20 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
example/dave.cpp
View File

@ -212,11 +212,15 @@ main(int , char* [])
boost::breadth_first_search boost::breadth_first_search
(G, vertex(a, G), make_bfs_visitor( (G, vertex(a, G), make_bfs_visitor(
std::make_pair(write_property(make_iterator_property_map(name, vertex_id, name[0]), std::make_pair(write_property(make_iterator_property_map(name, vertex_id,
cout_char, on_discover_vertex()), name[0]),
std::make_pair(write_property(make_iterator_property_map(distance.begin(), vertex_id, distance[0]), cout_char, on_examine_vertex()),
cout_int, on_discover_vertex()), std::make_pair(write_property(make_iterator_property_map(distance.begin(),
std::make_pair(print_edge(make_iterator_property_map(name, vertex_id, name[0]), vertex_id,
distance[0]),
cout_int, on_examine_vertex()),
std::make_pair(print_edge(make_iterator_property_map(name, vertex_id,
name[0]),
std::cout, on_examine_edge()), std::cout, on_examine_edge()),
print_endl(std::cout, on_finish_vertex() print_endl(std::cout, on_finish_vertex()
)))))); ))))));
@ -225,18 +229,23 @@ main(int , char* [])
dijkstra_shortest_paths(G, vertex(a, G), dijkstra_shortest_paths(G, vertex(a, G),
make_iterator_property_map(distance.begin(), vertex_id, distance[0]), make_iterator_property_map(distance.begin(), vertex_id, distance[0]),
make_ucs_visitor(std::make_pair(copy_graph(G_copy, on_examine_edge()), make_ucs_visitor(std::make_pair(copy_graph(G_copy, on_examine_edge()),
record_predecessors(make_iterator_property_map(parent.begin(), vertex_id, parent[0]), record_predecessors(make_iterator_property_map(parent.begin(), vertex_id,
parent[0]),
on_edge_relaxed())))); on_edge_relaxed()))));
cout << endl; cout << endl;
cout << "Result:" << endl; cout << "Result:" << endl;
breadth_first_search breadth_first_search
(G_copy, vertex(a, G_copy), make_bfs_visitor( (G_copy, vertex(a, G_copy), make_bfs_visitor(
std::make_pair(write_property(make_iterator_property_map(name, vertex_id, name[0]), std::make_pair(write_property(make_iterator_property_map(name, vertex_id,
cout_char, on_discover_vertex()), name[0]),
std::make_pair(write_property(make_iterator_property_map(distance.begin(), vertex_id, distance[0]), cout_char, on_examine_vertex()),
cout_int, on_discover_vertex()), std::make_pair(write_property(make_iterator_property_map(distance.begin(),
std::make_pair(print_edge(make_iterator_property_map(name, vertex_id, name[0]), vertex_id,
distance[0]),
cout_int, on_examine_vertex()),
std::make_pair(print_edge(make_iterator_property_map(name, vertex_id,
name[0]),
std::cout, on_examine_edge()), std::cout, on_examine_edge()),
print_endl(std::cout, on_finish_vertex() print_endl(std::cout, on_finish_vertex()
)))))); ))))));