Searched refs:ci_end (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | make_connected.hpp | 52 vec_of_vertices_itr_t ci_end = vertices_by_component.end(); in make_connected() local
54 if (ci_prev == ci_end) in make_connected()
57 for (vec_of_vertices_itr_t ci = boost::next(ci_prev); ci != ci_end; in make_connected()
|
| D | graph_utility.hpp | 349 vi_end, ci, ci_end; in is_connected() local
354 for (boost::tie(ci, ci_end) = vertices(g); ci != ci_end; ++ci) in is_connected()
|
| /third_party/boost/libs/graph/example/ |
| D | subgraph.cpp | 95 Graph::children_iterator ci, ci_end; in main() local
97 for (boost::tie(ci, ci_end) = G0.children(); ci != ci_end; ++ci) in main()
|
| D | accum-compile-times.cpp | 94 ci_end; in main() local
95 boost::tie(ci, ci_end) = get_property_iter_range(g, vertex_compile_cost); in main()
97 << std::accumulate(ci, ci_end, 0.0) << std::endl; in main()
|
| D | parallel-compile-time.cpp | 193 ci_end; in main() local
194 boost::tie(ci, ci_end) = get_property_iter_range(g, vertex_distance); in main()
196 << *std::max_element(ci, ci_end) << std::endl; in main()
|