35     : current_distance(0), distance(d), parent(p), color(c), src(s)  in bfs_testing_visitor()
47         BOOST_TEST(distance[u] == current_distance  in examine_vertex()
48             || distance[u] == current_distance + 1);  in examine_vertex()
49         if (distance[u] == current_distance + 1) // new level  in examine_vertex()
62             BOOST_TEST(distance[u] == current_distance + 1);  in discover_vertex()
63             BOOST_TEST(distance[u] == distance[parent[u]] + 1);  in discover_vertex()
74         BOOST_TEST(distance[u] == current_distance);  in tree_edge()
76         distance[v] = distance[u] + 1;  in tree_edge()
84             BOOST_TEST(distance[target(e, g)] <= distance[source(e, g)] + 1);  in non_tree_edge()
88             BOOST_TEST(distance[target(e, g)] == distance[source(e, g)]  in non_tree_edge()
89                 || distance[target(e, g)] == distance[source(e, g)] + 1  in non_tree_edge()
90                 || distance[target(e, g)] == distance[source(e, g)] - 1);  in non_tree_edge()
118     DistanceMap distance;  member in bfs_testing_visitor
149                 std::vector< int > distance(  in go()  local
151                 distance[start] = 0;  in go()
166                 distance_pm_type distance_pm(distance.begin(), idx);  in go()
200                         BOOST_TEST(distance[*ui] == distance[parent[*ui]] + 1);  in go()