Searched refs:u_end (Results 1 – 9 of 9) sorted by relevance
/third_party/boost/boost/graph/ |
D | push_relabel_max_flow.hpp | 154 vertex_iterator u_iter, u_end; in push_relabel() local 162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel() 170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel() 217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel() 249 vertex_iterator u_iter, u_end; in global_distance_update() local 250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update() 484 vertex_iterator u_iter, u_end; in convert_preflow_to_flow() local 497 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow() 505 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow() 514 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow() [all …]
|
D | stoer_wagner_min_cut.hpp | 160 typename graph_traits< UndirectedGraph >::vertex_iterator u_iter, u_end; in stoer_wagner_min_cut() local 171 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in stoer_wagner_min_cut()
|
D | johnson_all_pairs_shortest.hpp | 100 typename Traits2::vertex_iterator v, v_end, u, u_end; in johnson_all_pairs_shortest_paths() local 124 for (boost::tie(u, u_end) = vertices(g2); u != u_end; ++u) in johnson_all_pairs_shortest_paths()
|
D | edmonds_karp_max_flow.hpp | 91 typename graph_traits< Graph >::vertex_iterator u_iter, u_end; in edmonds_karp_max_flow() local 93 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in edmonds_karp_max_flow()
|
/third_party/boost/libs/graph/example/ |
D | edmonds-karp-eg.cpp | 86 graph_traits< Graph >::vertex_iterator u_iter, u_end; in main() local 88 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in main()
|
D | max_flow.cpp | 88 graph_traits< Graph >::vertex_iterator u_iter, u_end; in main() local 90 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in main()
|
D | push-relabel-eg.cpp | 78 graph_traits< Graph >::vertex_iterator u_iter, u_end; in main() local 80 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in main()
|
D | boykov_kolmogorov-eg.cpp | 104 graph_traits< Graph >::vertex_iterator u_iter, u_end; in main() local 106 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in main()
|
/third_party/ffmpeg/libavcodec/ |
D | cpia.c | 63 uint8_t *y, *u, *v, *y_end, *u_end, *v_end; in cpia_decode_frame() local 134 u_end = u + frame->linesize[1] - 1; in cpia_decode_frame() 162 if (y + 1 > y_end || u > u_end || v > v_end) { in cpia_decode_frame()
|