Home
last modified time | relevance | path

Searched refs:e_end (Results 1 – 25 of 28) sorted by relevance

12

/third_party/boost/boost/graph/
Dboykov_kolmogorov_max_flow.hpp128 edge_iterator ei, e_end; in bk_max_flow() local
129 for (boost::tie(ei, e_end) = edges(m_g); ei != e_end; ++ei) in bk_max_flow()
176 out_edge_iterator ei, e_end; in augment_direct_paths() local
177 for (boost::tie(ei, e_end) = out_edges(m_source, m_g); ei != e_end; in augment_direct_paths()
240 for (boost::tie(ei, e_end) = out_edges(m_sink, m_g); ei != e_end; in augment_direct_paths()
277 out_edge_iterator ei, e_end; in grow() local
339 out_edge_iterator ei, e_end; in grow() local
528 out_edge_iterator ei, e_end; in adopt() local
529 for (boost::tie(ei, e_end) = out_edges(current_node, m_g); in adopt()
530 ei != e_end; ++ei) in adopt()
[all …]
Dwrite_dimacs.hpp65 edge_iterator ei, e_end; in write_dimacs_max_flow() local
66 for (boost::tie(ei, e_end) = edges(g); ei != e_end; ++ei) in write_dimacs_max_flow()
Djohnson_all_pairs_shortest.hpp84 typename Traits1::edge_iterator e, e_end; in johnson_all_pairs_shortest_paths() local
85 for (boost::tie(e, e_end) = edges(g1); e != e_end; ++e) in johnson_all_pairs_shortest_paths()
101 typename Traits2::edge_iterator e, e_end; in johnson_all_pairs_shortest_paths() local
118 for (boost::tie(e, e_end) = edges(g2); e != e_end; ++e) in johnson_all_pairs_shortest_paths()
Dedmonds_karp_max_flow.hpp92 typename graph_traits< Graph >::out_edge_iterator ei, e_end; in edmonds_karp_max_flow() local
94 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) in edmonds_karp_max_flow()
109 for (boost::tie(ei, e_end) = out_edges(src, g); ei != e_end; ++ei) in edmonds_karp_max_flow()
Ddag_shortest_paths.hpp58 typename graph_traits< VertexListGraph >::out_edge_iterator e, e_end; in dag_shortest_paths() local
59 for (boost::tie(e, e_end) = out_edges(u, g); e != e_end; ++e) in dag_shortest_paths()
Dpush_relabel_max_flow.hpp161 out_edge_iterator ei, e_end; in push_relabel() local
164 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; in push_relabel()
735 out_edge_iterator ei, e_end; in print_flow_values() local
738 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; in print_flow_values()
Dgraphml.hpp352 edge_iterator e, e_end; in write_graphml() local
354 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in write_graphml()
Dfruchterman_reingold.hpp338 edge_iterator e, e_end; in fruchterman_reingold_force_directed_layout() local
339 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in fruchterman_reingold_force_directed_layout()
/third_party/boost/libs/graph/example/
Ddfs-parenthesis.cpp45 graph_traits< GraphvizGraph >::edge_iterator e, e_end; in main() local
46 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in main()
Dreachable-loop-tail.cpp71 graph_traits< GraphvizDigraph >::edge_iterator e, e_end; in main() local
72 for (boost::tie(e, e_end) = edges(g_in); e != e_end; ++e) in main()
Dedmonds-karp-eg.cpp87 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
89 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) in main()
Dmax_flow.cpp89 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
91 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) in main()
Dpush-relabel-eg.cpp79 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
81 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) in main()
Dboykov_kolmogorov-eg.cpp105 graph_traits< Graph >::out_edge_iterator ei, e_end; in main() local
107 for (boost::tie(ei, e_end) = out_edges(*u_iter, g); ei != e_end; ++ei) in main()
Djohnson-eg.cpp43 graph_traits< Graph >::edge_iterator e, e_end; in main() local
44 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in main()
Dedge_property.cpp153 boost::graph_traits< Graph >::out_edge_iterator e, e_end; in main() local
156 for (boost::tie(e, e_end) = out_edges(*v, G); e != e_end; ++e) in main()
Dundirected_adjacency_list.cpp94 typename boost::graph_traits< UndirectedGraph >::out_edge_iterator e, e_end; in undirected_graph_demo2() local
97 for (boost::tie(e, e_end) = out_edges(s, undigraph); e != e_end; ++e) in undirected_graph_demo2()
/third_party/boost/libs/graph/test/
Dboykov_kolmogorov_max_flow_test.cpp73 typename graph_traits< Graph >::edge_iterator ei, e_end; in fill_random_max_flow_graph() local
74 for (boost::tie(ei, e_end) = edges(g); ei != e_end; ++ei) in fill_random_max_flow_graph()
85 boost::tie(ei, e_end) = edges(g); in fill_random_max_flow_graph()
86 std::copy(ei, e_end, in fill_random_max_flow_graph()
278 typename graph_traits< Graph >::out_edge_iterator ei, e_end; in invariant_four() local
279 for (boost::tie(ei, e_end) = out_edges(v, tSuper::m_g); ei != e_end; in invariant_four()
411 tOutEdgeIterator ei, e_end; in test() local
413 for (boost::tie(ei, e_end) = out_edges(this->m_source, this->m_g); in test()
414 ei != e_end; ++ei) in test()
421 for (boost::tie(ei, e_end) = out_edges(this->m_sink, this->m_g); in test()
[all …]
Djohnson-test.cpp54 graph_traits< Graph >::edge_iterator e, e_end; in main() local
55 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in main()
Dgraph.cpp358 graph_traits< Graph >::out_edge_iterator e, e_end; in main() local
359 boost::tie(e, e_end) = out_edges(vid, g); in main()
360 if (e != e_end) in main()
369 boost::tie(e, e_end) = out_edges(vidp1, g); in main()
370 if (e != e_end) in main()
383 graph_traits< Graph >::edge_iterator e, e_end; in main() local
384 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in main()
Dgraphml_test.cpp97 graph_traits< graph_t >::edge_iterator e, e_end; in main() local
98 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e) in main()
Dmax_flow_test.cpp115 graph_traits< Graph >::edge_iterator ei, e_end; in main() local
116 boost::tie(ei, e_end) = edges(g); in main()
118 ei, e_end, std::back_insert_iterator< std::list< tEdge > >(edges_copy)); in main()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/common/
Ddpp_backup.c540 const u8 *next, *e_end; in dpp_parse_recipient_infos() local
601 e_end = pos + hdr.length; in dpp_parse_recipient_infos()
604 if (asn1_get_alg_id(pos, e_end - pos, &oid, &params, &params_len, in dpp_parse_recipient_infos()
631 asn1_get_sequence(params, params_len, &hdr, &e_end) < 0) in dpp_parse_recipient_infos()
635 if (asn1_get_next(pos, e_end - pos, &hdr) < 0 || in dpp_parse_recipient_infos()
651 if (asn1_get_integer(pos, e_end - pos, &val, &pos) < 0) in dpp_parse_recipient_infos()
658 if (asn1_get_integer(pos, e_end - pos, &val, &pos) < 0) in dpp_parse_recipient_infos()
666 if (asn1_get_sequence(pos, e_end - pos, &hdr, NULL) < 0 || in dpp_parse_recipient_infos()
/third_party/boost/libs/graph/doc/
Dwrite_graphml.rst123 graph_traits<Graph>::edge_iterator e, e_end;
124 for (tie(e,e_end) = edges(g); e != e_end; ++e)
/third_party/ffmpeg/libavformat/
Dwtvdec.c1045 AVIndexEntry *e_end = wtv->index_entries + wtv->nb_index_entries - 1; in read_header() local
1050 while (e <= e_end && frame_nb > e->size) { in read_header()
1058 e_end->pos = last_position; in read_header()
1060 st->duration = e_end->timestamp; in read_header()

12