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

added examine_vertex() to fill the old spot of discover_vertex()

Browse Source 
[SVN r8637]
This commit is contained in:
Jeremy Siek
2001-01-18 04:07:48 +00:00
parent 19e37ef272
commit cb809502f8
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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