Searched refs:oei_end (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/libs/graph/test/ |
| D | csr_graph_test.cpp | 318 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
319 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; in graph_test()
330 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; in graph_test()
|
| /third_party/boost/boost/graph/ |
| D | r_c_shortest_paths.hpp | 398 typename graph_traits< Graph >::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
399 for (boost::tie(oei, oei_end) = out_edges(cur_vertex, g); in r_c_shortest_paths_dispatch()
400 oei != oei_end; ++oei) in r_c_shortest_paths_dispatch()
|
| D | max_cardinality_matching.hpp | 392 out_edge_iterator_t oei, oei_end; in link_and_set_bridges() local
393 for (boost::tie(oei, oei_end) = out_edges(v, g); oei != oei_end; in link_and_set_bridges()
|
| D | maximum_weighted_matching.hpp | 293 out_edge_iterator_t oei, oei_end; in bloom() local
294 for (boost::tie(oei, oei_end) = out_edges(*vi, g); oei != oei_end; in bloom()
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 1066 out_edge_iterator_t oei, oei_end; in extract_kuratowski_subgraph() local
1270 for (boost::tie(oei, oei_end) = out_edges(*vi, g); in extract_kuratowski_subgraph()
1271 oei != oei_end; ++oei) in extract_kuratowski_subgraph()
1563 for (boost::tie(oei, oei_end) = out_edges(w, g); oei != oei_end; in extract_kuratowski_subgraph()
|