| /third_party/boost/libs/graph/test/ |
| D | graph_test.hpp | 31 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef
38 typedef iterator_property_map< typename std::vector< vertex_t >::iterator,
39 index_map_t, vertex_t, vertex_t& >
45 ignore_vertex(vertex_t v) : v(v) {} in ignore_vertex()
46 bool operator()(vertex_t x) const { return x != v; } in operator ()()
47 vertex_t v;
58 ignore_edges(vertex_t s, vertex_t t, const Graph& g) : s(s), t(t), g(g) in ignore_edges()
65 vertex_t s;
66 vertex_t t;
73 void test_incidence_graph(const std::vector< vertex_t >& vertex_set, in test_incidence_graph()
[all …]
|
| D | dijkstra_cc.cpp | 41 vertex_t; in main() typedef
43 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
46 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
50 vertex_t s; in main()
53 readable_property_map_archetype< vertex_t, int > index; in main()
54 read_write_property_map_archetype< vertex_t, std::size_t > distance; in main()
62 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
65 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
68 vertex_t s; in main()
74 read_write_property_map_archetype< vertex_t, vertex_t > pred; in main()
[all …]
|
| D | bfs_cc.cpp | 19 vertex_t; in main() typedef
21 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
24 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
28 vertex_t s; in main()
29 read_write_property_map_archetype< vertex_t, color_value_archetype > in main()
34 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
37 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
41 vertex_t s; in main()
42 readable_property_map_archetype< vertex_t, std::size_t > v_index; in main()
46 typedef incidence_graph_archetype< vertex_t, undirected_tag, in main()
[all …]
|
| D | dfs_cc.cpp | 19 vertex_t; in main() typedef
21 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
24 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
28 read_write_property_map_archetype< vertex_t, color_value_archetype > in main()
33 typedef incidence_graph_archetype< vertex_t, directed_tag, in main()
36 typedef vertex_list_graph_archetype< vertex_t, directed_tag, in main()
40 readable_property_map_archetype< vertex_t, std::size_t > v_index; in main()
44 typedef incidence_graph_archetype< vertex_t, undirected_tag, in main()
47 typedef vertex_list_graph_archetype< vertex_t, undirected_tag, in main()
|
| D | basic_planarity_test.cpp | 39 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in test_K_5() typedef
42 vertex_t v1 = add_vertex(g); in test_K_5()
43 vertex_t v2 = add_vertex(g); in test_K_5()
44 vertex_t v3 = add_vertex(g); in test_K_5()
45 vertex_t v4 = add_vertex(g); in test_K_5()
46 vertex_t v5 = add_vertex(g); in test_K_5()
77 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in test_K_3_3() typedef
80 vertex_t v1 = add_vertex(g); in test_K_3_3()
81 vertex_t v2 = add_vertex(g); in test_K_3_3()
82 vertex_t v3 = add_vertex(g); in test_K_3_3()
[all …]
|
| D | subgraph.cpp | 55 typedef graph_traits< subgraph_t >::vertex_descriptor vertex_t; in main() typedef
62 std::vector< vertex_t > vertex_set; in main()
63 std::vector< std::pair< vertex_t, vertex_t > > edge_set; in main()
76 std::vector< vertex_t > sub_vertex_set; in main()
77 std::vector< vertex_t > sub_global_map; in main()
78 std::vector< vertex_t > global_sub_map(num_vertices(g)); in main()
79 std::vector< std::pair< vertex_t, vertex_t > > sub_edge_set; in main()
83 const std::set< vertex_t >::size_type Nsub = N / 2; in main()
86 std::set< vertex_t > verts; in main()
90 for (std::set< vertex_t >::iterator it = verts.begin(); in main()
[all …]
|
| D | dijkstra_no_color_map_compare.cpp | 43 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in run_dijkstra_test() typedef
45 typedef typename std::map< vertex_t, vertex_t > vertex_map_t; in run_dijkstra_test()
51 typedef typename std::map< vertex_t, double > vertex_double_map_t; in run_dijkstra_test()
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 72 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in tree_edge() typedef
73 vertex_t s(source(e, g)); in tree_edge()
74 vertex_t t(target(e, g)); in tree_edge()
84 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in back_edge() typedef
87 vertex_t s(source(e, g)); in back_edge()
88 vertex_t t(target(e, g)); in back_edge()
140 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::boyer_myrvold_impl
149 typedef std::vector< vertex_t > vertex_vector_t;
151 typedef std::list< vertex_t > vertex_list_t;
155 typedef boost::tuple< vertex_t, bool, bool > merge_stack_frame_t;
[all …]
|
| D | face_handles.hpp | 231 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef
256 vertex_t cached_first_vertex;
257 vertex_t cached_second_vertex;
258 vertex_t true_first_vertex;
259 vertex_t true_second_vertex;
260 vertex_t anchor;
265 old_handles_storage< StoreOldHandlesPolicy, vertex_t, edge_t >
275 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::graph::detail::face_handle
284 face_handle(vertex_t anchor = graph_traits< Graph >::null_vertex()) in face_handle()
290 face_handle(vertex_t anchor, edge_t initial_edge, const Graph& g) in face_handle()
[all …]
|
| D | face_iterators.hpp | 95 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::face_iterator
117 face_iterator(vertex_t anchor, FaceHandlesMap face_handles, in face_iterator()
127 inline vertex_t get_first_vertex( in get_first_vertex()
133 inline vertex_t get_second_vertex( in get_second_vertex()
139 inline vertex_t get_first_vertex( in get_first_vertex()
145 inline vertex_t get_second_vertex( in get_second_vertex()
188 inline void set_edge_to_first_dispatch(face_handle_t, vertex_t, T) in set_edge_to_first_dispatch() argument
193 inline void set_edge_to_second_dispatch(face_handle_t, vertex_t, T) in set_edge_to_second_dispatch() argument
200 vertex_t first = get_first_vertex(curr_face_handle, Time()); in increment()
201 vertex_t second = get_second_vertex(curr_face_handle, Time()); in increment()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | chrobak_payne_drawing.hpp | 66 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in chrobak_payne_straight_line_drawing() typedef
71 typedef std::vector< vertex_t > vertex_vector_t; in chrobak_payne_straight_line_drawing()
108 vertex_t v1 = *itr; in chrobak_payne_straight_line_drawing()
110 vertex_t v2 = *itr; in chrobak_payne_straight_line_drawing()
112 vertex_t v3 = *itr; in chrobak_payne_straight_line_drawing()
129 vertex_t v = *itr; in chrobak_payne_straight_line_drawing()
138 vertex_t leftmost = graph_traits< Graph >::null_vertex(); in chrobak_payne_straight_line_drawing()
139 vertex_t rightmost = graph_traits< Graph >::null_vertex(); in chrobak_payne_straight_line_drawing()
143 vertex_t prev_vertex = graph_traits< Graph >::null_vertex(); in chrobak_payne_straight_line_drawing()
148 vertex_t curr_vertex in chrobak_payne_straight_line_drawing()
[all …]
|
| D | is_straight_line_drawing.hpp | 94 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in is_straight_line_drawing() typedef
116 vertex_t s(source(e, g)); in is_straight_line_drawing()
117 vertex_t t(target(e, g)); in is_straight_line_drawing()
140 vertex_t source_v(source(e, g)); in is_straight_line_drawing()
141 vertex_t target_v(target(e, g)); in is_straight_line_drawing()
166 vertex_t e_source(source(e, g)); in is_straight_line_drawing()
167 vertex_t e_target(target(e, g)); in is_straight_line_drawing()
168 vertex_t f_source(source(f, g)); in is_straight_line_drawing()
169 vertex_t f_target(target(f, g)); in is_straight_line_drawing()
182 vertex_t e_source(source(e, g)); in is_straight_line_drawing()
[all …]
|
| D | make_biconnected_planar.hpp | 29 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in make_biconnected_planar() typedef
40 std::vector< vertex_t > articulation_points; in make_biconnected_planar()
47 typename std::vector< vertex_t >::iterator ap, ap_end; in make_biconnected_planar()
51 vertex_t v(*ap); in make_biconnected_planar()
55 vertex_t previous_vertex = graph_traits< Graph >::null_vertex(); in make_biconnected_planar()
60 vertex_t e_source(source(e, g)); in make_biconnected_planar()
61 vertex_t e_target(target(e, g)); in make_biconnected_planar()
67 vertex_t current_vertex = e_source == v ? e_target : e_source; in make_biconnected_planar()
|
| D | planar_canonical_ordering.hpp | 39 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in planar_canonical_ordering() typedef
46 typedef iterator_property_map< typename std::vector< vertex_t >::iterator, in planar_canonical_ordering()
53 std::vector< vertex_t > processed_neighbor_vector(num_vertices(g)); in planar_canonical_ordering()
61 std::list< vertex_t > ready_to_be_processed; in planar_canonical_ordering()
63 vertex_t first_vertex = *vertices(g).first; in planar_canonical_ordering()
64 vertex_t second_vertex = first_vertex; in planar_canonical_ordering()
82 vertex_t u = ready_to_be_processed.front(); in planar_canonical_ordering()
104 vertex_t v = source(e, g) == u ? target(e, g) : source(e, g); in planar_canonical_ordering()
106 vertex_t prior_vertex = source(*prior_edge_itr, g) == u in planar_canonical_ordering()
109 vertex_t next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering()
[all …]
|
| D | planar_face_traversal.hpp | 42 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in planar_face_traversal() typedef
50 typedef typename std::vector< std::set< vertex_t > > in planar_face_traversal()
52 typedef typename std::vector< std::map< vertex_t, edge_t > > in planar_face_traversal()
82 vertex_t v(*vi); in planar_face_traversal()
88 std::map< vertex_t, edge_t > m = get(next_edge, e); in planar_face_traversal()
102 std::vector< vertex_t > vertices_in_edge; in planar_face_traversal()
122 typename std::vector< vertex_t >::iterator vi, vi_end; in planar_face_traversal()
129 vertex_t v(*vi); in planar_face_traversal()
130 std::set< vertex_t > e_visited = get(visited, e); in planar_face_traversal()
131 typename std::set< vertex_t >::iterator e_visited_found in planar_face_traversal()
|
| D | minimum_degree_ordering.hpp | 235 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::detail::predicateRemoveEdge1
251 vertex_t dist = target(e, *g); in operator ()()
274 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::detail::predicate_remove_tagged_edges
285 vertex_t dist = target(e, *g); in operator ()()
305 typedef typename Traits::vertex_descriptor vertex_t; typedef in boost::detail::mmd_impl
307 typedef iterator_property_map< vertex_t*, identity_property_map,
308 vertex_t, vertex_t& >
311 typedef bucket_sorter< size_type, vertex_t, DegreeMap, VertexIndexMap >
313 typedef Numbering< InversePermutationMap, diff_t, vertex_t,
316 typedef degreelists_marker< diff_t, vertex_t, VertexIndexMap >
[all …]
|
| D | howard_cycle_ratio.hpp | 104 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; typedef in boost::detail::mcr_howard
123 typedef typename std::list< vertex_t >
267 void mcr_bfv(vertex_t sv, float_t cr, color_map_t c) in mcr_bfv()
269 boost::queue< vertex_t > Q; in mcr_bfv()
274 vertex_t v = Q.top(); in mcr_bfv()
303 vertex_t find_cycle_vertex(vertex_t sv) in find_cycle_vertex()
305 vertex_t gv = sv; in find_cycle_vertex()
326 float_t cycle_ratio(vertex_t sv) in cycle_ratio()
331 vertex_t v = sv; in cycle_ratio()
365 vertex_t gv = find_cycle_vertex(*uv_itr); in policy_mcr()
[all …]
|
| D | is_kuratowski_subgraph.hpp | 98 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in is_kuratowski_subgraph() typedef
103 typedef typename std::vector< vertex_t > v_list_t; in is_kuratowski_subgraph()
132 vertex_t u(source(e, g)); in is_kuratowski_subgraph()
133 vertex_t v(target(e, g)); in is_kuratowski_subgraph()
145 vertex_t v(*vi); in is_kuratowski_subgraph()
169 vertex_t min_u = graph_traits< Graph >::null_vertex(); in is_kuratowski_subgraph()
170 vertex_t u; in is_kuratowski_subgraph()
248 std::map< vertex_t, in is_kuratowski_subgraph()
|
| D | edge_coloring.hpp | 56 typename boost::graph_traits< Graph >::vertex_descriptor vertex_t; in maximal_fan() typedef
57 std::vector< vertex_t > fan; in maximal_fan()
65 vertex_t v = target(e, g); in maximal_fan()
167 typedef typename boost::graph_traits< Graph >::vertex_descriptor vertex_t; in color_edge() typedef
169 typedef typename std::vector< vertex_t >::iterator fan_iterator; in color_edge()
171 vertex_t x = source(e, g), y = target(e, g); in color_edge()
172 std::vector< vertex_t > fan = maximal_fan(g, color, x, y); in color_edge()
|
| /third_party/boost/libs/graph/example/ |
| D | roget_components.cpp | 22 typedef graph_traits< Graph* >::vertex_descriptor vertex_t; in main() typedef
69 property_map< Graph*, v_property< vertex_t > >::type root in main()
70 = get(v_property< vertex_t >(), g); in main()
78 std::vector< std::vector< vertex_t > > strong_comp(num_comp); in main()
97 vertex_t v = strong_comp[c].front(); in main()
127 vertex_t u = strong_comp[c][0]; in main()
130 vertex_t v = strong_comp[c][i]; in main()
134 vertex_t x = target(*ei, g); in main()
139 vertex_t w = strong_comp[comp_x][0]; in main()
|
| D | topo-sort-file-dep2.cpp | 33 typedef graph_traits< file_dep_graph >::vertex_descriptor vertex_t; typedef
38 const file_dep_graph& g, vertex_t u, default_color_type* color, Visitor vis) in dfs_v1()
88 topo_visitor(vertex_t*& order) : topo_order(order) {} in topo_visitor()
89 void finish_vertex(vertex_t u, const file_dep_graph&) { *--topo_order = u; } in finish_vertex()
90 vertex_t*& topo_order;
93 void topo_sort(const file_dep_graph& g, vertex_t* topo_order) in topo_sort()
128 std::vector< vertex_t > order(num_vertices(g)); in main()
|
| D | topo-sort-file-dep.cpp | 33 typedef graph_traits< file_dep_graph >::vertex_descriptor vertex_t; typedef
37 const file_dep_graph& g, vertex_t u, vertex_t*& topo_order, int* mark) in topo_sort_dfs()
48 void topo_sort(const file_dep_graph& g, vertex_t* topo_order) in topo_sort()
85 std::vector< vertex_t > order(num_vertices(g)); in main()
|
| D | graph_as_tree.cpp | 38 typedef graph_traits< graph_t >::vertex_descriptor vertex_t; in main() typedef
42 vertex_t a = add_vertex(g), b = add_vertex(g), c = add_vertex(g); in main()
53 typedef iterator_property_map< std::vector< vertex_t >::iterator, in main()
56 std::vector< vertex_t > parent(num_vertices(g)); in main()
|
| D | topo-sort-with-leda.cpp | 21 typedef graph_traits< graph_t >::vertex_descriptor vertex_t; in main() typedef
22 std::vector< vertex_t > vert(7); in main()
40 std::vector< vertex_t > topo_order; in main()
48 for (std::vector< vertex_t >::iterator i = topo_order.begin(); in main()
|
| /third_party/boost/libs/python/src/object/ |
| D | inheritance.cpp | 75 typedef cast_graph::vertex_descriptor vertex_t; typedef
87 node_distance_map distances_to(vertex_t target) const in distances_to()
157 , vertex_t // corresponding vertex
191 , boost::make_tuple(type, vertex_t(), dynamic_id_function(0)) in type_position()
214 vertex_t v = add_vertex(full_graph().topology()); in demand_type()
215 vertex_t v2 = add_vertex(up_graph().topology()); in demand_type()
241 , vertex_t target in q_elt()
252 vertex_t target;
286 void* search(smart_graph const& g, void* p, vertex_t src, vertex_t dst) in search()
301 typedef std::pair<vertex_t,void*> search_state; in search()
[all …]
|