From f85a60382b9cc27b9739c08d65fc59c1e1281e5c Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Thu, 18 Jan 2001 04:04:58 +0000
Subject: [PATCH] discover_vertex -> examine_vertex

[SVN r8634]
---
 example/dave.cpp | 31 ++++++++++++++++++++-----------
 1 file changed, 20 insertions(+), 11 deletions(-)

diff --git a/example/dave.cpp b/example/dave.cpp
index fe355faf..dd9889b9 100644
--- a/example/dave.cpp
+++ b/example/dave.cpp
@@ -212,11 +212,15 @@ main(int , char* [])
 
   boost::breadth_first_search
     (G, vertex(a, G), make_bfs_visitor(
-     std::make_pair(write_property(make_iterator_property_map(name, vertex_id, name[0]),
-                                   cout_char, on_discover_vertex()),
-     std::make_pair(write_property(make_iterator_property_map(distance.begin(), vertex_id, distance[0]), 
-                                   cout_int, on_discover_vertex()),
-     std::make_pair(print_edge(make_iterator_property_map(name, vertex_id, name[0]),
+     std::make_pair(write_property(make_iterator_property_map(name, vertex_id,
+                                                              name[0]),
+                                   cout_char, on_examine_vertex()),
+     std::make_pair(write_property(make_iterator_property_map(distance.begin(),
+                                                              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()),
                     print_endl(std::cout, on_finish_vertex()
                     ))))));
@@ -225,18 +229,23 @@ main(int , char* [])
   dijkstra_shortest_paths(G, vertex(a, G), 
     make_iterator_property_map(distance.begin(), vertex_id, distance[0]),
     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()))));
 
   cout << endl;
   cout << "Result:" << endl;
   breadth_first_search
     (G_copy, vertex(a, G_copy), make_bfs_visitor(
-     std::make_pair(write_property(make_iterator_property_map(name, vertex_id, name[0]), 
-                                   cout_char, on_discover_vertex()),
-     std::make_pair(write_property(make_iterator_property_map(distance.begin(), vertex_id, distance[0]),
-                                   cout_int, on_discover_vertex()),
-     std::make_pair(print_edge(make_iterator_property_map(name, vertex_id, name[0]), 
+     std::make_pair(write_property(make_iterator_property_map(name, vertex_id,
+                                                              name[0]), 
+                                   cout_char, on_examine_vertex()),
+     std::make_pair(write_property(make_iterator_property_map(distance.begin(),
+                                                              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()),
                     print_endl(std::cout, on_finish_vertex()
                                ))))));