| /third_party/boost/boost/graph/ |
| D | howard_cycle_ratio.hpp | 210 typename graph_traits< Graph >::out_edge_iterator oei, oeie; in mcr_bound() local
217 for (boost::tie(oei, oeie) = out_edges(*vi, m_g); oei != oeie; in mcr_bound()
218 ++oei) in mcr_bound()
220 s += std::abs(m_ew1m[*oei]); in mcr_bound()
221 float_t a = std::abs(m_ew2m[*oei]); in mcr_bound()
238 typename graph_traits< Graph >::out_edge_iterator oei, oeie; in construct_policy_graph() local
241 boost::tie(oei, oeie) = out_edges(*vi, m_g); in construct_policy_graph()
243 = std::max_element(oei, oeie, in construct_policy_graph()
397 typename graph_traits< Graph >::out_edge_iterator oei, oeie; in try_improve_policy() local
403 for (boost::tie(oei, oeie) = out_edges(*vi, m_g); in try_improve_policy()
[all …]
|
| 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()
407 *oei, target(*oei, g)); 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()
394 ++oei) in link_and_set_bridges()
396 if (target(*oei, g) != v) in link_and_set_bridges()
398 even_edges.push_back(*oei); 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()
295 ++oei) in bloom()
297 if (target(*oei, g) != *vi && mate[*vi] != target(*oei, g)) in bloom()
298 even_edges.push_back(*oei); in bloom()
|
| /third_party/boost/libs/graph/example/ |
| D | read_write_dimacs-eg.cpp | 95 out_edge_iterator oei, oe_end; in main() local
96 for (boost::tie(oei, oe_end) = out_edges(s, g); oei != oe_end; ++oei) in main()
98 edge_descriptor from_source = *oei; in main()
|
| /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()
1272 if (!outer_face_edge[*oei]) in extract_kuratowski_subgraph()
1273 goal_edge[*oei] = true; in extract_kuratowski_subgraph()
1563 for (boost::tie(oei, oei_end) = out_edges(w, g); oei != oei_end; in extract_kuratowski_subgraph()
1564 ++oei) in extract_kuratowski_subgraph()
1566 if (!outer_face_edge[*oei]) in extract_kuratowski_subgraph()
1567 goal_edge[*oei] = true; in extract_kuratowski_subgraph()
|
| /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()
320 ++oei) in graph_test()
322 BOOST_TEST(source(*oei, g2) == *vi); in graph_test()
|
| /third_party/ninja/src/ |
| D | build.cc | 571 oei = dyndep_roots.begin(); oei != dyndep_roots.end(); ++oei) { in DyndepsLoaded() local
572 DyndepFile::const_iterator oe = *oei; in DyndepsLoaded()
|
| /third_party/icu/icu4c/source/data/locales/ |
| D | sr_Latn.txt | 1152 "Đoei (1232–1233)",
|
| D | lt.txt | 2405 "Džoei (1232–1233)",
|
| /third_party/flutter/skia/third_party/externals/icu/source/data/locales/ |
| D | sr_Latn.txt | 1148 "Đoei (1232–1233)",
|
| D | lt.txt | 2357 "Džoei (1232–1233)",
|
| /third_party/skia/third_party/externals/icu/source/data/locales/ |
| D | sr_Latn.txt | 1152 "Đoei (1232–1233)",
|
| D | lt.txt | 2405 "Džoei (1232–1233)",
|