| /third_party/boost/boost/graph/ |
| D | iteration_macros.hpp | 62 typename boost::graph_traits< GraphType >::vertex_iterator, \
63 typename boost::graph_traits< GraphType >::vertex_iterator > \
68 for (typename boost::graph_traits< GraphType >::vertex_descriptor \
76 for (std::pair< boost::graph_traits< GraphType >::vertex_iterator, \
77 boost::graph_traits< GraphType >::vertex_iterator > \
82 for (boost::graph_traits< GraphType >::vertex_descriptor VNAME; \
89 for (std::pair< typename boost::graph_traits< GraphType >::edge_iterator, \
90 typename boost::graph_traits< GraphType >::edge_iterator > \
95 for (typename boost::graph_traits< GraphType >::edge_descriptor ENAME; \
102 for (std::pair< boost::graph_traits< GraphType >::edge_iterator, \
[all …]
|
| D | leda_graph.hpp | 43 struct graph_traits< leda::GRAPH< vtype, etype > > struct
196 template <> struct graph_traits< leda::graph > struct
353 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor source( in source()
354 typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, in source()
361 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor target( in target()
362 typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, in target()
370 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator,
371 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator >
375 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator in vertices()
382 typename graph_traits< leda::GRAPH< vtype, etype > >::edge_iterator,
[all …]
|
| D | clustering_coefficient.hpp | 21 inline typename graph_traits< Graph >::degree_size_type possible_edges( in possible_edges()
25 typedef typename graph_traits< Graph >::degree_size_type T; in possible_edges()
30 inline typename graph_traits< Graph >::degree_size_type possible_edges( in possible_edges()
39 inline typename graph_traits< Graph >::degree_size_type count_edges( in count_edges()
40 const Graph& g, typename graph_traits< Graph >::vertex_descriptor u, in count_edges()
41 typename graph_traits< Graph >::vertex_descriptor v, directed_tag) in count_edges()
51 inline typename graph_traits< Graph >::degree_size_type count_edges( in count_edges()
52 const Graph& g, typename graph_traits< Graph >::vertex_descriptor u, in count_edges()
53 typename graph_traits< Graph >::vertex_descriptor v, undirected_tag) in count_edges()
61 inline typename graph_traits< Graph >::degree_size_type
[all …]
|
| D | graph_concepts.hpp | 59 typedef typename graph_traits< G >::vertex_descriptor vertex_descriptor;
60 typedef typename graph_traits< G >::edge_descriptor edge_descriptor;
61 typedef typename graph_traits< G >::directed_category directed_category;
62 typedef typename graph_traits< G >::edge_parallel_category
64 typedef typename graph_traits< G >::traversal_category traversal_category;
77 typedef typename graph_traits< G >::edge_descriptor edge_descriptor;
78 typedef typename graph_traits< G >::out_edge_iterator out_edge_iterator;
79 typedef typename graph_traits< G >::degree_size_type degree_size_type;
80 typedef typename graph_traits< G >::traversal_category traversal_category;
112 typename graph_traits< G >::vertex_descriptor u, v;
[all …]
|
| D | wavefront.hpp | 28 typename graph_traits< Graph >::vertices_size_type ith_wavefront( in ith_wavefront()
29 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g, in ith_wavefront()
32 typename graph_traits< Graph >::vertex_descriptor v, w; in ith_wavefront()
33 typename graph_traits< Graph >::vertices_size_type b = 1; in ith_wavefront()
34 typename graph_traits< Graph >::out_edge_iterator edge_it2, edge_it2_end; in ith_wavefront()
35 typename graph_traits< Graph >::vertices_size_type index_i = index[i]; in ith_wavefront()
40 typename graph_traits< Graph >::vertex_iterator ui, ui_end; in ith_wavefront()
63 typename graph_traits< Graph >::vertices_size_type ith_wavefront( in ith_wavefront()
64 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g) in ith_wavefront()
70 typename graph_traits< Graph >::vertices_size_type max_wavefront( in max_wavefront()
[all …]
|
| D | edmonds_karp_max_flow.hpp | 45 typename graph_traits< Graph >::vertex_descriptor src, in augment()
46 typename graph_traits< Graph >::vertex_descriptor sink, PredEdgeMap p, in augment()
49 typename graph_traits< Graph >::edge_descriptor e; in augment()
50 typename graph_traits< Graph >::vertex_descriptor u; in augment()
82 Graph& g, typename graph_traits< Graph >::vertex_descriptor src, in edmonds_karp_max_flow()
83 typename graph_traits< Graph >::vertex_descriptor sink, CapacityEdgeMap cap, in edmonds_karp_max_flow()
87 typedef typename graph_traits< Graph >::vertex_descriptor vertex_t; in edmonds_karp_max_flow()
91 typename graph_traits< Graph >::vertex_iterator u_iter, u_end; in edmonds_karp_max_flow()
92 typename graph_traits< Graph >::out_edge_iterator ei, e_end; in edmonds_karp_max_flow()
124 Graph& g, typename graph_traits< Graph >::vertex_descriptor src, in apply()
[all …]
|
| D | random.hpp | 36 typename graph_traits< Graph >::vertex_descriptor random_vertex( in random_vertex()
49 typename graph_traits< Graph >::vertex_iterator i = vertices(g).first; in random_vertex()
57 typename graph_traits< Graph >::edge_descriptor random_edge( in random_edge()
63 typename graph_traits< Graph >::edges_size_type n in random_edge()
69 typename graph_traits< Graph >::edges_size_type n = rand_gen(); in random_edge()
71 typename graph_traits< Graph >::edge_iterator i = edges(g).first; in random_edge()
79 typename graph_traits< Graph >::edge_descriptor random_out_edge(Graph& g, in random_out_edge()
80 typename graph_traits< Graph >::vertex_descriptor src, RandomNumGen& gen) in random_out_edge()
82 typedef typename graph_traits< Graph >::degree_size_type degree_size_type; in random_out_edge()
86 typename graph_traits< Graph >::out_edge_iterator it in random_out_edge()
[all …]
|
| D | bandwidth.hpp | 19 typename graph_traits< Graph >::vertices_size_type ith_bandwidth( in ith_bandwidth()
20 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g, in ith_bandwidth()
26 typename graph_traits< Graph >::vertices_size_type vertices_size_type; in ith_bandwidth()
28 typename graph_traits< Graph >::out_edge_iterator e, end; in ith_bandwidth()
40 typename graph_traits< Graph >::vertices_size_type ith_bandwidth( in ith_bandwidth()
41 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g) in ith_bandwidth()
47 typename graph_traits< Graph >::vertices_size_type bandwidth( in bandwidth()
53 typename graph_traits< Graph >::vertices_size_type vertices_size_type; in bandwidth()
55 typename graph_traits< Graph >::edge_iterator i, end; in bandwidth()
67 typename graph_traits< Graph >::vertices_size_type bandwidth(const Graph& g) in bandwidth()
[all …]
|
| D | max_cardinality_matching.hpp | 42 typename graph_traits< Graph >::vertices_size_type matching_size( in matching_size()
45 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in matching_size()
47 typename graph_traits< Graph >::vertex_descriptor vertex_descriptor_t; in matching_size()
48 typedef typename graph_traits< Graph >::vertices_size_type v_size_t; in matching_size()
56 if (get(mate, v) != graph_traits< Graph >::null_vertex() in matching_size()
64 inline typename graph_traits< Graph >::vertices_size_type matching_size( in matching_size()
74 typename graph_traits< Graph >::vertex_descriptor vertex_descriptor_t; in is_a_matching()
75 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator_t; in is_a_matching()
81 if (get(mate, v) != graph_traits< Graph >::null_vertex() in is_a_matching()
128 typename graph_traits< Graph >::vertex_descriptor vertex_descriptor_t;
[all …]
|
| D | reverse_graph.hpp | 127 typename graph_traits< G >::edge_descriptor >,
128 typename graph_traits< G >::edge_iterator >
147 typedef graph_traits< BidirectionalGraph > Traits;
305 typename graph_traits< BidirectionalGraph >::edge_descriptor >( in edges()
314 const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, in out_edges()
318 typename graph_traits< BidirectionalGraph >::edge_descriptor >( in out_edges()
323 inline typename graph_traits< BidirectionalGraph >::vertices_size_type
337 inline typename graph_traits< BidirectionalGraph >::degree_size_type out_degree( in out_degree()
338 const typename graph_traits< BidirectionalGraph >::vertex_descriptor u, in out_degree()
345 inline typename graph_traits< BidirectionalGraph >::vertex_descriptor vertex( in vertex()
[all …]
|
| D | erdos_renyi_generator.hpp | 31 std::pair< typename graph_traits< Graph >::vertices_size_type,
32 typename graph_traits< Graph >::vertices_size_type >,
34 const std::pair< typename graph_traits< Graph >::vertices_size_type,
35 typename graph_traits< Graph >::vertices_size_type >& >
37 typedef typename graph_traits< Graph >::directed_category directed_category;
39 typename graph_traits< Graph >::vertices_size_type vertices_size_type;
40 typedef typename graph_traits< Graph >::edges_size_type edges_size_type;
105 std::pair< typename graph_traits< Graph >::vertices_size_type,
106 typename graph_traits< Graph >::vertices_size_type >,
108 const std::pair< typename graph_traits< Graph >::vertices_size_type,
[all …]
|
| D | labeled_graph.hpp | 125 std::pair< typename graph_traits< Graph >::vertex_descriptor, bool >
129 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in insert_labeled_vertex()
146 std::pair< typename graph_traits< Graph >::vertex_descriptor, bool >
152 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in insert_labeled_vertex()
161 std::pair< typename graph_traits< Graph >::vertex_descriptor, bool >
167 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in insert_labeled_vertex()
181 std::pair< typename graph_traits< Graph >::vertex_descriptor, bool >
192 typename graph_traits< Graph >::vertex_descriptor find_labeled_vertex( in find_labeled_vertex()
196 return l < c.size() ? c[l] : graph_traits< Graph >::null_vertex(); in find_labeled_vertex()
201 typename graph_traits< Graph >::vertex_descriptor find_labeled_vertex( in find_labeled_vertex()
[all …]
|
| D | successive_shortest_path_nonnegative_weights.hpp | 39 typedef graph_traits< Graph > gtraits;
78 typename graph_traits< Graph >::vertex_descriptor s, in successive_shortest_path_nonnegative_weights()
79 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights()
85 typedef typename graph_traits< Graph >::edge_descriptor edge_descriptor; in successive_shortest_path_nonnegative_weights()
127 typename graph_traits< Graph >::vertex_descriptor s, in successive_shortest_path_nonnegative_weights_dispatch3()
128 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch3()
141 typename graph_traits< Graph >::vertex_descriptor s, in successive_shortest_path_nonnegative_weights_dispatch3()
142 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch3()
159 typename graph_traits< Graph >::vertex_descriptor s, in successive_shortest_path_nonnegative_weights_dispatch2()
160 typename graph_traits< Graph >::vertex_descriptor t, Capacity capacity, in successive_shortest_path_nonnegative_weights_dispatch2()
[all …]
|
| D | copy.hpp | 181 typename graph_traits< Graph >::edge_descriptor > in apply()
183 typename graph_traits< Graph >::vertex_iterator vi, vi_end; in apply()
186 typename graph_traits< MutableGraph >::vertex_descriptor new_v in apply()
191 typename graph_traits< Graph >::edge_iterator ei, ei_end; in apply()
194 typename graph_traits< MutableGraph >::edge_descriptor new_e; in apply()
215 typename graph_traits< Graph >::edge_descriptor > in apply()
217 typename graph_traits< Graph >::vertex_iterator vi, vi_end; in apply()
220 typename graph_traits< MutableGraph >::vertex_descriptor new_v in apply()
227 typename graph_traits< Graph >::out_edge_iterator ei, ei_end; in apply()
231 typename graph_traits< MutableGraph >::edge_descriptor in apply()
[all …]
|
| D | lookup_edge.hpp | 25 std::pair< typename boost::graph_traits< Graph >::edge_descriptor, bool >
26 lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src, in lookup_edge()
27 typename boost::graph_traits< Graph >::vertex_descriptor tgt, in lookup_edge()
35 std::pair< typename boost::graph_traits< Graph >::edge_descriptor, bool >
36 lookup_edge(typename boost::graph_traits< Graph >::vertex_descriptor src, in lookup_edge()
37 typename boost::graph_traits< Graph >::vertex_descriptor tgt, in lookup_edge()
41 typedef typename boost::graph_traits< Graph >::out_edge_iterator it; in lookup_edge()
42 typedef typename boost::graph_traits< Graph >::edge_descriptor edesc; in lookup_edge()
|
| D | r_c_shortest_paths.hpp | 38 const typename graph_traits< Graph >::edge_descriptor& ed
39 = graph_traits< Graph >::edge_descriptor(),
40 const typename graph_traits< Graph >::vertex_descriptor& vd
41 = graph_traits< Graph >::vertex_descriptor())
65 const typename graph_traits< Graph >::edge_descriptor pred_edge;
66 const typename graph_traits< Graph >::vertex_descriptor resident_vertex;
172 typename graph_traits< Graph >::vertex_descriptor s, in r_c_shortest_paths_dispatch()
173 typename graph_traits< Graph >::vertex_descriptor t, in r_c_shortest_paths_dispatch()
176 std::vector< typename graph_traits< Graph >::edge_descriptor > >& in r_c_shortest_paths_dispatch()
216 typename graph_traits< Graph >::edge_descriptor(), s); in r_c_shortest_paths_dispatch()
[all …]
|
| D | graph_utility.hpp | 34 inline std::pair< typename graph_traits< UndirectedGraph >::vertex_descriptor,
35 typename graph_traits< UndirectedGraph >::vertex_descriptor >
36 incident(typename graph_traits< UndirectedGraph >::edge_descriptor e, in incident()
45 inline std::pair< typename graph_traits< Graph >::out_edge_iterator,
46 typename graph_traits< Graph >::out_edge_iterator >
47 incident_edges(typename graph_traits< Graph >::vertex_descriptor u, Graph& g) in incident_edges()
53 inline typename graph_traits< Graph >::vertex_descriptor opposite( in opposite()
54 typename graph_traits< Graph >::edge_descriptor e, in opposite()
55 typename graph_traits< Graph >::vertex_descriptor v, const Graph& g) in opposite()
57 typedef typename graph_traits< Graph >::vertex_descriptor vertex_descriptor; in opposite()
[all …]
|
| D | tiernan_all_cycles.hpp | 124 typename graph_traits< Graph >::vertex_descriptor v, const Path& p) in is_vertex_in_path()
131 typename graph_traits< Graph >::vertex_descriptor u, in is_path_closed()
132 typename graph_traits< Graph >::vertex_descriptor v, in is_path_closed()
148 typename graph_traits< Graph >::edge_descriptor e, const Path& p, in can_extend_path()
153 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in can_extend_path()
175 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in can_wrap_path()
176 typedef typename graph_traits< Graph >::out_edge_iterator OutIterator; in can_wrap_path()
195 inline typename graph_traits< Graph >::vertex_descriptor extend_path( in extend_path()
199 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in extend_path()
200 typedef typename graph_traits< Graph >::out_edge_iterator OutIterator; in extend_path()
[all …]
|
| D | vf2_sub_graph_iso.hpp | 85 typedef typename graph_traits< GraphThis >::vertex_descriptor
87 typedef typename graph_traits< GraphOther >::vertex_descriptor
91 typename graph_traits< GraphThis >::vertices_size_type size_type;
128 graph_traits< GraphOther >::null_vertex()) in base_state()
237 put(core_, v_this, graph_traits< GraphOther >::null_vertex()); in pop()
249 && (get(core_, v) == graph_traits< GraphOther >::null_vertex()); in term_in()
259 && (get(core_, v) == graph_traits< GraphOther >::null_vertex()); in term_out()
269 && (get(core_, v) == graph_traits< GraphOther >::null_vertex()); in term_both()
276 return get(core_, v) != graph_traits< GraphOther >::null_vertex(); in in_core()
319 typename boost::graph_traits< Graph >::edge_descriptor edge_type;
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | concepts.hpp | 41 typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
42 typedef typename graph_traits<G>::vertices_size_type vertices_size_type;
43 typedef typename graph_traits<G>::traversal_category
78 typename graph_traits<G>::vertex_descriptor v;
86 typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
87 typedef typename graph_traits<G>::edge_iterator edge_iterator;
88 typedef typename graph_traits<G>::edges_size_type edges_size_type;
89 typedef typename graph_traits<G>::traversal_category
114 typename graph_traits<G>::vertex_descriptor u, v;
115 typename graph_traits<G>::edge_descriptor e;
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | graph-assoc-types.cpp | 16 typedef typename graph_traits< Graph >::vertex_descriptor Vertex; in generic_foo()
17 typedef typename graph_traits< Graph >::edge_descriptor Edge; in generic_foo()
19 typedef typename graph_traits< Graph >::directed_category Dir; in generic_foo()
20 typedef typename graph_traits< Graph >::edge_parallel_category Par; in generic_foo()
29 typename graph_traits< Graph >::vertex_descriptor u = vertex(0, g), in generic_bar()
31 typename graph_traits< Graph >::edge_descriptor e1, e2; in generic_bar()
55 typedef typename boost::graph_traits< Graph >::directed_category Cat; in foo()
61 typename graph_traits< Digraph >::vertex_descriptor u, in foo()
62 typename graph_traits< Digraph >::vertex_descriptor v) in foo()
64 typedef typename graph_traits< Digraph >::edge_descriptor edge_t; in foo()
[all …]
|
| D | helper.hpp | 18 typename boost::graph_traits< Graph >::vertex_descriptor add_named_vertex( in add_named_vertex()
21 typedef typename boost::graph_traits< Graph >::vertex_descriptor Vertex; in add_named_vertex()
46 typename boost::graph_traits< Graph >::vertex_descriptor >
49 typedef typename boost::graph_traits< Graph >::vertex_descriptor Vertex; in read_graph()
68 typename boost::graph_traits< Graph >::vertex_descriptor >
71 typedef typename boost::graph_traits< Graph >::vertex_descriptor Vertex; in read_graph()
79 typename boost::graph_traits< Graph >::vertex_descriptor >
82 typedef typename boost::graph_traits< Graph >::vertex_descriptor Vertex; in read_weighted_graph()
83 typedef typename boost::graph_traits< Graph >::edge_descriptor Edge; in read_weighted_graph()
113 typename boost::graph_traits< Graph >::vertex_descriptor >
[all …]
|
| D | edge-connectivity.cpp | 27 std::pair< typename graph_traits< Graph >::vertex_descriptor,
28 typename graph_traits< Graph >::degree_size_type >
31 typename graph_traits< Graph >::vertex_descriptor p; in min_degree_vertex()
32 typedef typename graph_traits< Graph >::degree_size_type size_type; in min_degree_vertex()
34 typename graph_traits< Graph >::vertex_iterator i, iend; in min_degree_vertex()
46 typename graph_traits< Graph >::vertex_descriptor u, OutputIterator result) in neighbors()
48 typename graph_traits< Graph >::adjacency_iterator ai, aend; in neighbors()
61 typename graph_traits< VertexListGraph >::degree_size_type edge_connectivity( in edge_connectivity()
64 typedef typename graph_traits< VertexListGraph >::vertex_descriptor in edge_connectivity()
66 typedef typename graph_traits< VertexListGraph >::degree_size_type in edge_connectivity()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | adj_list_cc.cpp | 22 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
23 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
43 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
44 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
65 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
66 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
84 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
85 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
104 typedef graph_traits< Graph >::vertex_descriptor Vertex; in main()
105 typedef graph_traits< Graph >::edge_descriptor Edge; in main()
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 36 typedef typename graph_traits<Graph>::edge_descriptor argument_type;
68 graph_traits<Graph1>::vertex_iterator v, v_end; in test_main()
79 graph_traits<Graph1>::vertex_descriptor other = *v; in test_main()
92 graph_traits<Graph1>::vertex_iterator vi = vertices(g1).first; in test_main()
93 graph_traits<Graph1>::vertex_descriptor u = *vi++; in test_main()
94 graph_traits<Graph1>::vertex_descriptor v = *vi++; in test_main()
106 graph_traits<Graph1>::vertex_descriptor u = *vertices(g1).first; in test_main()
143 graph_traits<Graph2>::vertex_iterator v, v_end; in test_main()
155 graph_traits<Graph2>::vertex_iterator vi = vertices(g2).first; in test_main()
156 graph_traits<Graph2>::vertex_descriptor u = *vi++; in test_main()
[all …]
|