Searched refs:viend (Results 1 – 7 of 7) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | dominator_tree.hpp | 389 vertexItr vi, viend; in iterative_bit_vector_dominator_tree() local
390 boost::tie(vi, viend) = vertices(g); in iterative_bit_vector_dominator_tree()
391 const std::set< Vertex > N(vi, viend); in iterative_bit_vector_dominator_tree()
403 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in iterative_bit_vector_dominator_tree()
433 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in iterative_bit_vector_dominator_tree()
438 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in iterative_bit_vector_dominator_tree()
461 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in iterative_bit_vector_dominator_tree()
|
| D | graph_utility.hpp | 238 typename graph_traits< Graph >::adjacency_iterator vi, viend, adj_found; in is_adj_dispatch() local
239 boost::tie(vi, viend) = adjacent_vertices(a, g); in is_adj_dispatch()
240 adj_found = std::find(vi, viend, b); in is_adj_dispatch()
241 if (adj_found == viend) in is_adj_dispatch()
261 typename graph_traits< Graph >::adjacency_iterator vi, viend, found; in is_adj_dispatch() local
262 boost::tie(vi, viend) = adjacent_vertices(a, g); in is_adj_dispatch()
263 found = std::find(vi, viend, b); in is_adj_dispatch()
264 if (found == viend) in is_adj_dispatch()
|
| /third_party/boost/libs/graph/example/ |
| D | graph.cpp | 53 typename Graph::adjacency_iterator vi, viend, found; in check_edge() local
54 boost::tie(vi, viend) = adjacent_vertices(vertex(a, g), g); in check_edge()
56 found = find(vi, viend, vertex(b, g)); in check_edge()
57 if (found == viend) in check_edge()
|
| D | adjacency_list.cpp | 69 boost::graph_traits< Graph >::vertex_iterator vi, viend; in main() local
72 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in main()
|
| D | dave.cpp | 147 typename boost::graph_traits< Graph >::adjacency_iterator vi, viend; in print() local
148 for (boost::tie(vi, viend) = adjacent_vertices(*ui, G); vi != viend; in print()
|
| /third_party/boost/libs/graph/test/ |
| D | graph.cpp | 57 typename graph_traits< Graph >::vertex_iterator vi, viend; in check_vertex_cleared() local
58 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in check_vertex_cleared()
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 684 typename Config::vertex_iterator vi, viend; in clear_vertex() local
685 for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi) in clear_vertex()
|