boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Code Issues Projects Releases Wiki Activity

removed start_vertex()

Browse Source 
[SVN r8624]
This commit is contained in:
Jeremy Siek
2001-01-17 05:53:22 +00:00
parent d5efa4eac5
commit 25f755aa90
2 changed files with 1 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
include/boost/graph/breadth_first_search.hpp
View File

@@ -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());
}

5
include/boost/graph/uniform_cost_search.hpp
View File

@@ -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);
}