20     Graph const& g, VertexSet const& verts, boost::mpl::true_)  in test_outdirected_graph()  argument
31     OutSet outs(verts.size());  in test_outdirected_graph()
32     for (size_t i = 0; i < verts.size(); ++i)  in test_outdirected_graph()
34         outs[i] = out_edges(verts[i], g);  in test_outdirected_graph()
46     BOOST_ASSERT(has_target(g, *outs[1].first, verts[0]));  in test_outdirected_graph()
47     BOOST_ASSERT(has_target(g, *outs[2].first, verts[1]));  in test_outdirected_graph()
52     BOOST_ASSERT(has_target(g, *outs[5].first, verts[3]));  in test_outdirected_graph()
67     Graph const& g, VertexSet const& verts, boost::mpl::true_)  in test_indirected_graph()  argument
78     InSet ins(verts.size());  in test_indirected_graph()
79     for (size_t i = 0; i < verts.size(); ++i)  in test_indirected_graph()
81         ins[i] = in_edges(verts[i], g);  in test_indirected_graph()
93     BOOST_ASSERT(has_source(g, *ins[2].first, verts[3]));  in test_indirected_graph()
94     BOOST_ASSERT(has_source(g, *ins[3].first, verts[5]));  in test_indirected_graph()
95     BOOST_ASSERT(has_source(g, *ins[4].first, verts[3]));  in test_indirected_graph()
109     Graph const& g, VertexSet const& verts, boost::mpl::true_)  in test_undirected_graph()  argument
120     OutSet outs(verts.size());  in test_undirected_graph()
121     for (size_t i = 0; i < verts.size(); ++i)  in test_undirected_graph()
123         outs[i] = out_edges(verts[i], g);  in test_undirected_graph()