From cb809502f82ef7136a32be17b2babb114c5b960e Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Thu, 18 Jan 2001 04:07:48 +0000
Subject: [PATCH] added examine_vertex() to fill the old spot of
 discover_vertex()

[SVN r8637]
---
 include/boost/graph/breadth_first_search.hpp | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/include/boost/graph/breadth_first_search.hpp b/include/boost/graph/breadth_first_search.hpp
index 69b4fbf4..50d9b15d 100644
--- a/include/boost/graph/breadth_first_search.hpp
+++ b/include/boost/graph/breadth_first_search.hpp
@@ -43,6 +43,7 @@ namespace boost {
     void constraints() {
       vis.initialize_vertex(u, g);
       vis.discover_vertex(u, g);
+      vis.examine_vertex(u, g);
       vis.examine_edge(e, g);
       vis.tree_edge(e, g);
       vis.cycle_edge(e, g);
@@ -104,6 +105,7 @@ namespace boost {
     while (! Q.empty()) {
       Vertex u = Q.top();
       Q.pop(); // pop before push to avoid problem if Q is priority_queue.
+      vis.examine_vertex(u, g);
       typename GTraits::out_edge_iterator ei, ei_end;
       for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) {
         Edge e = *ei;
@@ -141,6 +143,10 @@ namespace boost {
     void discover_vertex(Vertex u, Graph& g) {
       invoke_visitors(m_vis, u, g, on_discover_vertex());      
     }
+    template <class Vertex, class Graph>
+    void examine_vertex(Vertex u, Graph& g) {
+      invoke_visitors(m_vis, u, g, on_examine_vertex());
+    }
     template <class Edge, class Graph>
     void examine_edge(Edge e, Graph& g) {
       invoke_visitors(m_vis, e, g, on_examine_edge());