| /third_party/boost/boost/graph/distributed/ |
| D | concepts.hpp | 41 typedef typename graph_traits<G>::vertex_iterator vertex_iterator; typedef
47 BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept<vertex_iterator> )); in constraints()
77 std::pair<vertex_iterator,vertex_iterator> p;
123 typedef typename graph_traits<G>::vertex_iterator vertex_iterator;
128 BOOST_CONCEPT_ASSERT((MultiPassInputIterator<vertex_iterator>));
158 std::pair<vertex_iterator,vertex_iterator> p;
|
| /third_party/boost/libs/graph/test/ |
| D | betweenness_centrality_test.cpp | 40 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in run_weighted_test() typedef
45 vertex_iterator v, v_end; in run_weighted_test()
88 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in run_unweighted_test() typedef
93 vertex_iterator v, v_end; in run_unweighted_test()
178 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in run_wheel_test() typedef
186 vertex_iterator v, v_end; in run_wheel_test()
244 typename graph_traits< MutableGraph >::vertex_iterator vi, vi_end; in randomly_add_edges()
248 typename graph_traits< MutableGraph >::vertex_iterator wi in randomly_add_edges()
270 typename boost::graph_traits< Graph >::vertex_iterator vertex_iterator; in simple_unweighted_betweenness_centrality() typedef
278 vertex_iterator vi, vi_end; in simple_unweighted_betweenness_centrality()
[all …]
|
| D | layout_test.cpp | 58 typename graph_traits< Graph >::vertex_iterator vi, vi_end; in print_graph_layout()
83 typename graph_traits< Graph >::vertex_iterator vi, vi_end; in dump_graph_layout()
104 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in test_circle_layout() typedef
111 vertex_iterator vi = vertices(g).first; in test_circle_layout()
204 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in test_cube() typedef
206 vertex_iterator vi, vi_end; in test_cube()
276 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in test_triangular() typedef
278 vertex_iterator vi, vi_end; in test_triangular()
350 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in test_disconnected() typedef
352 vertex_iterator vi, vi_end; in test_disconnected()
|
| D | vf2_sub_graph_iso_test.cpp | 67 typedef typename graph_traits< Graph1 >::vertex_iterator vertex_iterator; in randomly_permute_graph() typedef
87 for (vertex_iterator vi = vertices(g1).first; vi != vertices(g1).second; in randomly_permute_graph()
118 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in generate_random_digraph() typedef
125 for (vertex_iterator u = vertices(g).first; u != vertices(g).second; ++u) in generate_random_digraph()
127 for (vertex_iterator v = vertices(g).first; v != vertices(g).second; in generate_random_digraph()
254 for (graph_traits< graph1 >::vertex_iterator vi = vertices(g1).first; in test_vf2_sub_graph_iso()
|
| D | bundled_properties.cpp | 137 adjacency_list< EL, VL, D, VP, EP, GP > >::vertex_iterator v2 in test_io()
163 typename boost::graph_traits< Map >::vertex_iterator vertex_iterator; in test_bundled_properties() typedef
171 vertex_iterator vi = vertices(map).first; in test_bundled_properties()
227 typedef boost::graph_traits< SubMap >::vertex_iterator vertex_iterator; in test_subgraph_bundled_properties() typedef
230 vertex_iterator vi = vertices(map).first; in test_subgraph_bundled_properties()
|
| D | isomorphism.cpp | 101 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in generate_random_digraph() typedef
108 for (vertex_iterator u = vertices(g).first; u != vertices(g).second; ++u) in generate_random_digraph()
110 vertex_iterator v = u; in generate_random_digraph()
135 for (graph2::vertex_iterator v = vertices(g2).first; in test_isomorphism2()
198 for (graph2::vertex_iterator v = vertices(g2).first; in test_isomorphism()
|
| /third_party/boost/boost/graph/ |
| D | sequential_vertex_coloring.hpp | 64 typename GraphTraits::vertex_iterator v, vend; in sequential_vertex_coloring()
107 typedef typename graph_traits< VertexListGraph >::vertex_iterator in sequential_vertex_coloring()
108 vertex_iterator; in sequential_vertex_coloring() typedef
110 std::pair< vertex_iterator, vertex_iterator > v = vertices(G); in sequential_vertex_coloring()
|
| D | gursoy_atun_layout.hpp | 146 typename graph_traits< VertexListAndIncidenceGraph >::vertex_iterator in gursoy_atun_step()
147 vertex_iterator; in gursoy_atun_step() typedef
152 vertex_iterator i, iend; in gursoy_atun_step()
214 typename graph_traits< VertexListAndIncidenceGraph >::vertex_iterator in gursoy_atun_refine()
215 vertex_iterator; in gursoy_atun_refine() typedef
216 vertex_iterator i, iend; in gursoy_atun_refine()
253 typename graph_traits< VertexListAndIncidenceGraph >::vertex_iterator in gursoy_atun_layout()
254 vertex_iterator; in gursoy_atun_layout() typedef
255 vertex_iterator i, iend; in gursoy_atun_layout()
|
| D | wavefront.hpp | 40 typename graph_traits< Graph >::vertex_iterator ui, ui_end; in ith_wavefront()
75 typename graph_traits< Graph >::vertex_iterator i, end; in max_wavefront()
92 typename graph_traits< Graph >::vertex_iterator i, end; in aver_wavefront()
109 typename graph_traits< Graph >::vertex_iterator i, end; in rms_wavefront()
|
| D | matrix_as_graph.hpp | 45 typedef boost::int_iterator< size_type > vertex_iterator; \
47 friend std::pair< vertex_iterator, vertex_iterator > vertices( \
50 typedef vertex_iterator VIter; \
|
| D | transitive_closure.hpp | 68 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in transitive_closure() typedef
220 vertex_iterator i, i_end; in transitive_closure()
252 vertex_iterator i, i_end; in transitive_closure()
317 typedef typename graph_traits< G >::vertex_iterator vertex_iterator; in warshall_transitive_closure() typedef
328 vertex_iterator ki, ke, ii, ie, ji, je; in warshall_transitive_closure()
342 typedef typename graph_traits< G >::vertex_iterator vertex_iterator; in warren_transitive_closure() typedef
357 vertex_iterator ic, ie, jc, je, kc, ke; in warren_transitive_closure()
|
| D | fruchterman_reingold.hpp | 82 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in operator ()() typedef
83 vertex_iterator v, end; in operator ()()
86 vertex_iterator u = v; in operator ()()
114 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in operator ()() typedef
123 vertex_iterator v, v_end; in operator ()()
315 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in fruchterman_reingold_force_directed_layout() typedef
332 vertex_iterator v, v_end; in fruchterman_reingold_force_directed_layout()
|
| D | graph_archetypes.hpp | 61 typedef void vertex_iterator; typedef
119 typedef void vertex_iterator; typedef
166 typedef input_iterator_archetype< Vertex > vertex_iterator; typedef
180 std::pair< typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator,
181 typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator >
184 typedef typename vertex_list_graph_archetype< V, D, P, B >::vertex_iterator in vertices()
|
| D | betweenness_centrality.hpp | 324 typename graph_traits< Graph >::vertex_iterator vertex_iterator; in brandes_betweenness_centrality_impl() typedef
333 vertex_iterator s, s_end; in brandes_betweenness_centrality_impl()
337 vertex_iterator w, w_end; in brandes_betweenness_centrality_impl()
597 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in relative_betweenness_centrality() typedef
604 vertex_iterator v, v_end; in relative_betweenness_centrality()
620 typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator; in central_point_dominance() typedef
628 vertex_iterator v, v_end; in central_point_dominance()
|
| D | kamada_kawai_spring_layout.hpp | 65 typename graph_traits< Graph >::vertex_iterator vertex_iterator; in compute_edge_length() typedef
67 for (vertex_iterator ui = vertices(g).first, in compute_edge_length()
71 vertex_iterator vi = ui; in compute_edge_length()
164 typename graph_traits< Graph >::vertex_iterator vertex_iterator; typedef
251 vertex_iterator ui, end; in run()
255 vertex_iterator vi = ui; in run()
314 vertex_iterator vi = ui; in run()
|
| D | directed_graph.hpp | 78 typedef typename graph_type::vertex_iterator vertex_iterator; typedef in boost::directed_graph
257 vertex_iterator i, end; in renumber_vertex_indices()
262 void remove_vertex_and_renumber_indices(vertex_iterator i) in remove_vertex_and_renumber_indices()
264 vertex_iterator j = next(i), end = vertices(m_graph).second; in remove_vertex_and_renumber_indices()
342 vertex_iterator i, vertex_iterator end, vertices_size_type n) in renumber_vertex_indices()
464 inline std::pair< typename DIRECTED_GRAPH::vertex_iterator,
465 typename DIRECTED_GRAPH::vertex_iterator >
744 typename DIRECTED_GRAPH::vertex_iterator i, DIRECTED_GRAPH& g) in remove_vertex_and_renumber_indices()
|
| D | undirected_graph.hpp | 78 typedef typename graph_type::vertex_iterator vertex_iterator; typedef in boost::undirected_graph
260 vertex_iterator i, i_end; in renumber_vertex_indices()
265 void remove_vertex_and_renumber_indices(vertex_iterator i) in remove_vertex_and_renumber_indices()
267 vertex_iterator j = next(i), end = vertices(m_graph).second; in remove_vertex_and_renumber_indices()
345 vertex_iterator i, vertex_iterator end, vertices_size_type n) in renumber_vertex_indices()
478 inline std::pair< typename UNDIRECTED_GRAPH::vertex_iterator,
479 typename UNDIRECTED_GRAPH::vertex_iterator >
769 typename UNDIRECTED_GRAPH::vertex_iterator i, UNDIRECTED_GRAPH& g) in remove_vertex_and_renumber_indices()
|
| D | iteration_macros.hpp | 62 typename boost::graph_traits< GraphType >::vertex_iterator, \
63 typename boost::graph_traits< GraphType >::vertex_iterator > \
76 for (std::pair< boost::graph_traits< GraphType >::vertex_iterator, \
77 boost::graph_traits< GraphType >::vertex_iterator > \
|
| D | leda_graph.hpp | 132 class vertex_iterator class
133 : public iterator_facade< vertex_iterator, leda::node,
137 vertex_iterator( in vertex_iterator() function in boost::graph_traits::vertex_iterator
146 bool equal(const vertex_iterator& other) const in equal()
282 class vertex_iterator class
283 : public iterator_facade< vertex_iterator, leda::node,
287 vertex_iterator(leda::node node = 0, const leda::graph* g = 0) in vertex_iterator() function in boost::graph_traits::vertex_iterator
295 bool equal(const vertex_iterator& other) const in equal()
370 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator,
371 typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator >
[all …]
|
| D | vertex_and_edge_range.hpp | 36 typedef VertexIterator vertex_iterator; typedef in boost::graph::vertex_and_edge_range
82 vertex_iterator first_vertex;
83 vertex_iterator last_vertex;
|
| D | edge_connectivity.hpp | 37 typename Traits::vertex_iterator i, iend; in min_degree_vertex()
75 typedef typename Traits::vertex_iterator vertex_iterator; in edge_connectivity() typedef
96 vertex_iterator vi, vi_end; in edge_connectivity()
|
| /third_party/boost/libs/graph/example/ |
| D | implicit_graph.cpp | 143 typedef boost::counting_iterator< vertex_descriptor > vertex_iterator; typedef in ring_graph
171 typedef boost::graph_traits< ring_graph >::vertex_iterator vertex_iterator; typedef
323 std::pair< vertex_iterator, vertex_iterator > vertices(const ring_graph& g) in vertices()
325 return std::pair< vertex_iterator, vertex_iterator >( in vertices()
326 vertex_iterator(0), // The first iterator position in vertices()
327 vertex_iterator(num_vertices(g))); // The last iterator position in vertices()
340 : public boost::iterator_adaptor< ring_edge_iterator, vertex_iterator,
486 vertex_iterator vi, vi_end; in main()
|
| D | girth.cpp | 55 typedef Traits::vertex_iterator vertex_iterator; typedef
139 vertex_iterator i, end; in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_betweenness_centrality_test.cpp | 245 typedef graph_traits<Graph>::vertex_iterator vertex_iterator; in test_main() typedef
246 vertex_iterator v, v_end; in test_main()
266 typedef graph_traits<seqGraph>::vertex_iterator vertex_iterator; in test_main() typedef
267 vertex_iterator v, v_end; in test_main()
|
| D | distributed_adjacency_list_test.cpp | 68 graph_traits<Graph1>::vertex_iterator v, v_end; in test_main()
92 graph_traits<Graph1>::vertex_iterator vi = 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()
189 graph_traits<Graph3>::vertex_iterator v, v_end; in test_main()
203 graph_traits<Graph3>::vertex_iterator vi = vertices(g3).first; in test_main()
247 graph_traits<Graph3>::vertex_iterator vi = vertices(g3).first; in test_main()
|