| /third_party/boost/boost/graph/ |
| D | max_cardinality_matching.hpp | 45 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in matching_size() typedef
51 vertex_iterator_t vi, vi_end; in matching_size()
75 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in is_a_matching() typedef
77 vertex_iterator_t vi, vi_end; in is_a_matching()
134 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; typedef in boost::edmonds_augmenting_path_finder
178 vertex_iterator_t vi, vi_end; in edmonds_augmenting_path_finder()
193 vertex_iterator_t vi, vi_end; in augment_matching()
357 vertex_iterator_t vi, vi_end; in get_current_matching()
364 vertex_iterator_t vi, vi_end; in get_vertex_state_map()
501 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; typedef
[all …]
|
| D | make_connected.hpp | 27 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in make_connected() typedef
43 vertex_iterator_t vi, vi_end; in make_connected()
|
| D | maximum_weighted_matching.hpp | 25 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in matching_weight_sum() typedef
32 vertex_iterator_t vi, vi_end; in matching_weight_sum()
63 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; typedef in boost::weighted_augmenting_path_finder
205 vertex_iterator_t vi, vi_end; in weighted_augmenting_path_finder()
336 vertex_iterator_t vi, vi_end; in missing_label()
707 vertex_iterator_t vi, vi_end; in augmenting()
773 vertex_iterator_t vi, vi_end; in blossoming()
846 vertex_iterator_t vi, vi_end; in init()
987 vertex_iterator_t vi, vi_end; in adjust_dual()
1133 vertex_iterator_t vi, vi_end; in get_current_matching()
[all …]
|
| D | is_kuratowski_subgraph.hpp | 99 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in is_kuratowski_subgraph() typedef
142 vertex_iterator_t vi, vi_end; in is_kuratowski_subgraph()
237 vertex_iterator_t vi, vi_end; in is_kuratowski_subgraph()
|
| D | planar_face_traversal.hpp | 44 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in planar_face_traversal() typedef
69 vertex_iterator_t vi, vi_end; in planar_face_traversal()
|
| D | make_maximal_planar.hpp | 34 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; typedef
59 vertex_iterator_t vi, vi_end; in triangulation_visitor()
|
| D | bipartite.hpp | 290 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in find_odd_cycle() typedef
291 vertex_iterator_t vertex_iter, vertex_end; in find_odd_cycle()
|
| D | chrobak_payne_drawing.hpp | 67 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in chrobak_payne_straight_line_drawing() typedef
229 vertex_iterator_t vi, vi_end; in chrobak_payne_straight_line_drawing()
|
| /third_party/boost/libs/graph/test/ |
| D | matching_test.cpp | 51 vertex_iterator_t; in install() typedef
55 vertex_iterator_t vi, vi_end; in install()
65 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in complete_graph() typedef
68 vertex_iterator_t vi, vi_end, wi; in complete_graph()
86 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in gabows_graph() typedef
90 vertex_iterator_t vi, vi_end, ui, ui_end, halfway; in gabows_graph()
128 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in matching_test() typedef
247 vertex_iterator_t vi, vi_end; in matching_test()
|
| D | weighted_matching_test.cpp | 45 vertex_iterator_t; in install() typedef
49 vertex_iterator_t vi, vi_end; in install()
94 typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in weighted_matching_test() typedef
95 vertex_iterator_t vi, vi_end; in weighted_matching_test()
|
| D | random_matching_test.cpp | 30 typedef graph_traits< undirected_graph >::vertex_iterator vertex_iterator_t; typedef
91 vertex_iterator_t vi, vi_end; in main()
100 vertex_iterator_t vi, vi_end; in main()
|
| D | parallel_edges_loops_test.cpp | 73 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in read_dimacs() typedef
101 vertex_iterator_t vi, vi_end; in read_dimacs()
168 typedef graph_traits< graph >::vertex_iterator vertex_iterator_t; in test_graph() typedef
175 vertex_iterator_t vi, vi_end; in test_graph()
|
| D | all_planar_input_files_test.cpp | 105 typedef graph_traits< graph >::vertex_iterator vertex_iterator_t; in test_graph() typedef
112 vertex_iterator_t vi, vi_end; in test_graph()
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 142 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; typedef in boost::boyer_myrvold_impl
321 vertex_iterator_t vi, vi_end; in boyer_myrvold_impl()
836 vertex_iterator_t xi, xi_end; in clean_up_embedding()
1064 vertex_iterator_t vi, vi_end; in extract_kuratowski_subgraph()
1747 vertex_iterator_t vi, vi_end; in make_edge_permutation()
|