From 25f755aa90b30647ebf61c24102a371ffb02cd7e Mon Sep 17 00:00:00 2001
From: Jeremy Siek <jeremy.siek@gmail.com>
Date: Wed, 17 Jan 2001 05:53:22 +0000
Subject: [PATCH] removed start_vertex()

[SVN r8624]
---
 include/boost/graph/breadth_first_search.hpp | 7 +------
 include/boost/graph/uniform_cost_search.hpp  | 5 -----
 2 files changed, 1 insertion(+), 11 deletions(-)

diff --git a/include/boost/graph/breadth_first_search.hpp b/include/boost/graph/breadth_first_search.hpp
index e0ee3e66..d63230a5 100644
--- a/include/boost/graph/breadth_first_search.hpp
+++ b/include/boost/graph/breadth_first_search.hpp
@@ -42,7 +42,6 @@ namespace boost {
   struct BFSVisitorConcept {
     void constraints() {
       vis.initialize_vertex(u, g);
-      vis.start_vertex(u, g);
       vis.discover_vertex(u, g);
       vis.examine_edge(e, g);
       vis.tree_edge(e, g);
@@ -100,7 +99,7 @@ namespace boost {
     typename property_traits<ColorMap>::value_type c = get(color, s);
 
     put(color, s, gray(c));
-    vis.start_vertex(s, g);
+    vis.discover_vertex(v, g);
     Q.push(s);
     while (! Q.empty()) {
       Vertex u = Q.top();
@@ -139,10 +138,6 @@ namespace boost {
       invoke_visitors(m_vis, u, g, on_initialize_vertex());      
     }
     template <class Vertex, class Graph>
-    void start_vertex(Vertex u, Graph& g) {
-      invoke_visitors(m_vis, u, g, on_start_vertex());      
-    }
-    template <class Vertex, class Graph>
     void discover_vertex(Vertex u, Graph& g) {
       invoke_visitors(m_vis, u, g, on_discover_vertex());      
     }
diff --git a/include/boost/graph/uniform_cost_search.hpp b/include/boost/graph/uniform_cost_search.hpp
index 20708db1..ff699a38 100644
--- a/include/boost/graph/uniform_cost_search.hpp
+++ b/include/boost/graph/uniform_cost_search.hpp
@@ -43,7 +43,6 @@ namespace boost {
   template <class Visitor, class Graph>
   struct UniformCostVisitorConcept {
     void constraints() {
-      vis.start_vertex(u, g);
       vis.initialize_vertex(u, g);
       vis.discover_vertex(u, g);
       vis.examine_edge(e, g);
@@ -125,10 +124,6 @@ namespace boost {
         m_vis.initialize_vertex(u, g);
       }
       template <class Vertex, class Graph>
-      void start_vertex(Vertex u, Graph& g) {
-        m_vis.start_vertex(u, g);
-      }
-      template <class Vertex, class Graph>
       void discover_vertex(Vertex u, Graph& g) {
         m_vis.discover_vertex(u, g);
       }