| /third_party/boost/boost/graph/ |
| D | two_graphs_common_spanning_trees.hpp | 129 bimaps::set_of< typename graph_traits< Graph >::edge_descriptor > > in rec_two_graphs_common_spanning_trees()
133 bimaps::set_of< typename graph_traits< Graph >::edge_descriptor > > in rec_two_graphs_common_spanning_trees()
140 typedef typename GraphTraits::edge_descriptor edge_descriptor; in rec_two_graphs_common_spanning_trees() typedef
174 std::map< edge_descriptor, default_color_type > edge_color; in rec_two_graphs_common_spanning_trees()
176 std::stack< edge_descriptor > iG_buf, vG_buf; in rec_two_graphs_common_spanning_trees()
191 std::map< edge_descriptor, bool > > >(aiG_inL)), in rec_two_graphs_common_spanning_trees()
193 std::stack< edge_descriptor > >(&iG_buf)), in rec_two_graphs_common_spanning_trees()
198 std::map< edge_descriptor, default_color_type > >( in rec_two_graphs_common_spanning_trees()
203 std::map< edge_descriptor, bool > > >(avG_inL)), in rec_two_graphs_common_spanning_trees()
205 std::stack< edge_descriptor > >(&vG_buf)), in rec_two_graphs_common_spanning_trees()
[all …]
|
| D | graph_concepts.hpp | 60 typedef typename graph_traits< G >::edge_descriptor edge_descriptor; typedef
77 typedef typename graph_traits< G >::edge_descriptor edge_descriptor; typedef
90 BOOST_CONCEPT_ASSERT((DefaultConstructible< edge_descriptor >)); in BOOST_CONCEPT_USAGE()
91 BOOST_CONCEPT_ASSERT((EqualityComparable< edge_descriptor >)); in BOOST_CONCEPT_USAGE()
92 BOOST_CONCEPT_ASSERT((Assignable< edge_descriptor >)); in BOOST_CONCEPT_USAGE()
113 typename graph_traits< G >::edge_descriptor e;
147 typename graph_traits< G >::edge_descriptor e;
228 typedef typename graph_traits< G >::edge_descriptor edge_descriptor; typedef
236 BOOST_CONCEPT_ASSERT((DefaultConstructible< edge_descriptor >)); in BOOST_CONCEPT_USAGE()
237 BOOST_CONCEPT_ASSERT((EqualityComparable< edge_descriptor >)); in BOOST_CONCEPT_USAGE()
[all …]
|
| D | boykov_kolmogorov_max_flow.hpp | 81 typedef typename tGraphTraits::edge_descriptor edge_descriptor; typedef in boost::detail::bk_max_flow
151 edge_descriptor connecting_edge; in max_flow()
180 edge_descriptor from_source = *ei; in augment_direct_paths()
189 edge_descriptor to_sink; in augment_direct_paths()
243 edge_descriptor to_sink = get(m_rev_edge_map, *ei); in augment_direct_paths()
263 std::pair< edge_descriptor, bool > grow() in grow()
287 edge_descriptor out_edge = *m_last_grow_edge_it; in grow()
349 edge_descriptor in_edge in grow()
405 return std::make_pair(edge_descriptor(), false); in grow()
420 void augment(edge_descriptor e) in augment()
[all …]
|
| D | graph_archetypes.hpp | 47 struct edge_descriptor struct
49 edge_descriptor() {} in edge_descriptor() function
50 edge_descriptor(const detail::dummy_constructor&) {} in edge_descriptor() argument
51 bool operator==(const edge_descriptor&) const { return false; } in operator ==() argument
52 bool operator!=(const edge_descriptor&) const { return false; } in operator !=() argument
54 typedef input_iterator_archetype< edge_descriptor > out_edge_iterator;
68 const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor&, in source()
75 const typename incidence_graph_archetype< V, D, P, B >::edge_descriptor&, in target()
111 typedef void edge_descriptor; typedef
162 typedef typename Incidence::edge_descriptor edge_descriptor; typedef
[all …]
|
| D | edge_list.hpp | 58 struct edge_descriptor struct in boost::edge_list_impl
60 edge_descriptor() {} in edge_descriptor() function
61 edge_descriptor(EdgeIter p, edge_id id) : _ptr(p), _id(id) {} in edge_descriptor() function
66 typedef edge_descriptor E;
113 typename edge_list_impl< G, EI, T, D >::edge_descriptor e, in source()
120 typename edge_list_impl< G, EI, T, D >::edge_descriptor e, in target()
143 typename Graph::edge_descriptor >
164 typename edge_list_impl< G, EI, T, D >::edge_descriptor e) in get()
184 typedef edge_id edge_descriptor; typedef in boost::edge_list_impl_ra
205 typename edge_list_impl_ra< G, EI, T, D >::edge_descriptor e, in source()
[all …]
|
| D | grid_graph.hpp | 89 BOOST_GRID_GRAPH_TRAITS_T::edge_descriptor,
127 BOOST_GRID_GRAPH_TRAITS_T::edge_descriptor >
169 typedef typename graph_traits< Graph >::edge_descriptor result_type;
200 typedef typename graph_traits< Graph >::edge_descriptor result_type;
226 typedef typename graph_traits< Graph >::edge_descriptor result_type;
293 typedef std::pair< vertex_descriptor, vertex_descriptor > edge_descriptor; typedef in boost::grid_graph
488 edge_descriptor edge_at(edges_size_type edge_index) const in edge_at()
564 edges_size_type index_of(edge_descriptor edge) const in index_of()
689 edge_descriptor out_edge_at( in out_edge_at()
745 edge_descriptor in_edge_at( in in_edge_at()
[all …]
|
| D | reverse_graph.hpp | 127 typename graph_traits< G >::edge_descriptor >,
166 typename Traits::edge_descriptor >
167 edge_descriptor; typedef in boost::reverse_graph
174 typename Traits::edge_descriptor >,
181 typename Traits::edge_descriptor >,
305 typename graph_traits< BidirectionalGraph >::edge_descriptor >( in edges()
318 typename graph_traits< BidirectionalGraph >::edge_descriptor >( in out_edges()
354 GRef > >::edge_descriptor,
360 typedef typename graph_traits< BidirectionalGraph >::edge_descriptor in edge()
377 typename graph_traits< BidirectionalGraph >::edge_descriptor >( in in_edges()
[all …]
|
| D | cycle_canceling.hpp | 84 typedef typename ResGTraits::edge_descriptor edge_descriptor; in cycle_canceling() typedef
91 put(pred, v, edge_descriptor()); in cycle_canceling()
107 put(pred, v, edge_descriptor()); in cycle_canceling()
160 typedef typename graph_traits< Graph >::edge_descriptor edge_descriptor; in cycle_canceling_dispatch1() typedef
161 std::vector< edge_descriptor > p_map(num_vertices(g)); in cycle_canceling_dispatch1()
|
| D | subgraph.hpp | 90 typedef typename Traits::edge_descriptor edge_descriptor; typedef in boost::subgraph
219 edge_descriptor local_to_global(edge_descriptor e_local) const in local_to_global()
226 edge_descriptor global_to_local(edge_descriptor e_global) const in global_to_local()
249 std::pair< edge_descriptor, bool > find_edge(edge_descriptor e_global) const in find_edge()
256 return std::make_pair((valid ? (*i).second : edge_descriptor()), valid); in find_edge()
359 typedef std::vector< edge_descriptor > GlobalEdgeList;
361 typedef std::map< edge_index_type, edge_descriptor > LocalEdgeMap;
377 edge_descriptor local_add_edge(vertex_descriptor u_local, in local_add_edge()
378 vertex_descriptor v_local, edge_descriptor e_global) in local_add_edge()
380 edge_descriptor e_local; in local_add_edge()
[all …]
|
| D | undirected_graph.hpp | 75 typedef typename graph_type::edge_descriptor edge_descriptor; typedef in boost::undirected_graph
200 std::pair< edge_descriptor, bool > const& make_index( in make_index() argument
201 std::pair< edge_descriptor, bool > const& x) in make_index()
213 std::pair< edge_descriptor, bool > add_edge( in add_edge()
219 std::pair< edge_descriptor, bool > add_edge( in add_edge()
229 std::vector< edge_descriptor > edges; in remove_edge()
240 typename std::vector< edge_descriptor >::iterator j = edges.begin(), in remove_edge()
250 void remove_edge(edge_descriptor e) in remove_edge()
309 edge_bundled& operator[](edge_descriptor e) { return m_graph[e]; } in operator []()
311 edge_bundled const& operator[](edge_descriptor e) const in operator []()
[all …]
|
| D | directed_graph.hpp | 75 typedef typename graph_type::edge_descriptor edge_descriptor; typedef in boost::directed_graph
197 std::pair< edge_descriptor, bool > const& make_index( in make_index() argument
198 std::pair< edge_descriptor, bool > const& x) in make_index()
210 std::pair< edge_descriptor, bool > add_edge( in add_edge()
216 std::pair< edge_descriptor, bool > add_edge( in add_edge()
226 std::vector< edge_descriptor > edges; in remove_edge()
237 typename std::vector< edge_descriptor >::iterator j = edges.begin(), in remove_edge()
247 void remove_edge(edge_descriptor e) in remove_edge()
306 edge_bundled& operator[](edge_descriptor e) { return m_graph[e]; } in operator []()
308 edge_bundled const& operator[](edge_descriptor e) const in operator []()
[all …]
|
| D | r_c_shortest_paths.hpp | 38 const typename graph_traits< Graph >::edge_descriptor& ed
39 = graph_traits< Graph >::edge_descriptor(),
65 const typename graph_traits< Graph >::edge_descriptor pred_edge;
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()
441 std::vector< typename graph_traits< Graph >::edge_descriptor > in r_c_shortest_paths_dispatch()
540 std::vector< typename graph_traits< Graph >::edge_descriptor > >& in r_c_shortest_paths()
565 std::vector< typename graph_traits< Graph >::edge_descriptor >& in r_c_shortest_paths()
577 std::vector< typename graph_traits< Graph >::edge_descriptor > > in r_c_shortest_paths()
603 std::vector< typename graph_traits< Graph >::edge_descriptor > >& in r_c_shortest_paths()
[all …]
|
| D | loop_erased_random_walk.hpp | 55 typename boost::graph_traits< Graph >::edge_descriptor edge_descriptor; in loop_erased_random_walk() typedef
65 edge_descriptor e = next_edge(s, g); in loop_erased_random_walk()
108 typename gt::edge_descriptor operator()( in operator ()()
131 typename gt::edge_descriptor operator()( in operator ()()
|
| /third_party/boost/libs/graph/example/ |
| D | implicit_graph.cpp | 130 typedef std::pair< vertex_descriptor, vertex_descriptor > edge_descriptor; typedef in ring_graph
165 typedef boost::graph_traits< ring_graph >::edge_descriptor edge_descriptor; typedef
200 boost::counting_iterator< std::size_t >, edge_descriptor,
201 boost::use_default, edge_descriptor >
221 edge_descriptor dereference() const in dereference()
231 return edge_descriptor(m_u, v); in dereference()
239 vertex_descriptor source(edge_descriptor e, const ring_graph&) in source()
245 vertex_descriptor target(edge_descriptor e, const ring_graph&) in target()
341 edge_descriptor, boost::use_default, edge_descriptor >
357 edge_descriptor dereference() const in dereference()
[all …]
|
| D | edge-connectivity.cpp | 70 typename adjacency_list_traits< vecS, vecS, directedS >::edge_descriptor in edge_connectivity()
71 edge_descriptor; in edge_connectivity() typedef
75 property< edge_reverse_t, edge_descriptor > > > > in edge_connectivity()
79 edge_descriptor e1, e2; in edge_connectivity()
86 std::vector< edge_descriptor > pred(num_vertices(g)); in edge_connectivity()
168 typedef graph_traits< GraphvizGraph >::edge_descriptor edge_descriptor; in main() typedef
170 std::vector< edge_descriptor > disconnecting_set; in main()
180 for (std::vector< edge_descriptor >::iterator i = disconnecting_set.begin(); in main()
|
| D | edge_connectivity.cpp | 48 typedef graph_traits< UndirectedGraph >::edge_descriptor edge_descriptor; in main() typedef
50 std::vector< edge_descriptor > disconnecting_set; in main()
59 std::ostream_iterator< edge_descriptor >(std::cout, " ")); in main()
|
| D | read_write_dimacs-eg.cpp | 69 property< edge_reverse_t, Traits::edge_descriptor > > > in main()
73 typedef graph_traits< Graph >::edge_descriptor edge_descriptor; in main() typedef
98 edge_descriptor from_source = *oei; in main()
100 edge_descriptor to_sink; in main()
|
| /third_party/boost/boost/graph/distributed/ |
| D | concepts.hpp | 86 typedef typename graph_traits<G>::edge_descriptor edge_descriptor; typedef
94 BOOST_CONCEPT_ASSERT(( DefaultConstructibleConcept<edge_descriptor> )); in constraints()
95 BOOST_CONCEPT_ASSERT(( EqualityComparableConcept<edge_descriptor> )); in constraints()
96 BOOST_CONCEPT_ASSERT(( AssignableConcept<edge_descriptor> )); in constraints()
115 typename graph_traits<G>::edge_descriptor e;
167 typedef typename graph_traits<G>::edge_descriptor edge_descriptor;
174 BOOST_CONCEPT_ASSERT((DefaultConstructible<edge_descriptor>));
175 BOOST_CONCEPT_ASSERT((EqualityComparable<edge_descriptor>));
176 BOOST_CONCEPT_ASSERT((Assignable<edge_descriptor>));
195 typename graph_traits<G>::edge_descriptor e;
|
| D | adjacency_list.hpp | 316 struct edge_descriptor struct
318 edge_descriptor(processor_id_type sp = processor_id_type(), in edge_descriptor() argument
353 typedef edge_descriptor<Edge> result_type;
402 typedef edge_descriptor<Edge> result_type;
467 owner(const edge_descriptor<Edge>& e) in owner()
473 local(const edge_descriptor<Edge>& e) in local()
485 typedef edge_descriptor<Edge> key_type;
491 get(edge_global_property_map<Edge>, const edge_descriptor<Edge>& e) in get()
508 typedef edge_descriptor<Edge> key_type;
514 get(edge_owner_property_map<Edge>, const edge_descriptor<Edge>& e) in get()
[all …]
|
| D | dehne_gotz_min_spanning_tree.hpp | 74 typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor; typedef in boost::graph::distributed::detail::do_has_same_supervertex
79 bool operator()(edge_descriptor e) in operator ()()
158 typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor; in boruvka_merge_step() typedef
162 typedef boost::parallel::detail::untracked_pair<edge_descriptor, in boruvka_merge_step()
176 w_edge(edge_descriptor(), inf)); in boruvka_merge_step()
200 edge_descriptor e = candidate_edges[i].first; in boruvka_merge_step()
251 typedef typename graph_traits<Graph>::edge_descriptor Edge;
285 typedef typename graph_traits<Graph>::edge_descriptor Edge;
327 typedef typename graph_traits<Graph>::edge_descriptor Edge;
446 typedef typename EdgeList::value_type edge_descriptor; in merge_local_minimum_spanning_trees_step() typedef
[all …]
|
| /third_party/boost/boost/graph/detail/ |
| D | compressed_sparse_row_struct.hpp | 498 typename CSRGraph::edge_descriptor, std::random_access_iterator_tag,
499 const typename CSRGraph::edge_descriptor&,
505 typedef typename CSRGraph::edge_descriptor edge_descriptor; typedef in boost::detail::csr_out_edge_iterator
511 explicit csr_out_edge_iterator(edge_descriptor edge) : m_edge(edge) {} in csr_out_edge_iterator()
515 const edge_descriptor& dereference() const { return m_edge; } in dereference()
531 edge_descriptor m_edge;
539 typename CSRGraph::edge_descriptor, boost::forward_traversal_tag,
540 typename CSRGraph::edge_descriptor >
543 typedef typename CSRGraph::edge_descriptor edge_descriptor; typedef in boost::detail::csr_edge_iterator
555 csr_edge_iterator(const CSRGraph& graph, edge_descriptor current_edge, in csr_edge_iterator()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | boykov_kolmogorov_max_flow_test.cpp | 57 typedef typename graph_traits< Graph >::edge_descriptor edge_descriptor; in fill_random_max_flow_graph() typedef
84 std::list< edge_descriptor > edges_copy; in fill_random_max_flow_graph()
87 std::back_insert_iterator< std::list< edge_descriptor > >(edges_copy)); in fill_random_max_flow_graph()
90 edge_descriptor old_edge = edges_copy.front(); in fill_random_max_flow_graph()
95 edge_descriptor new_edge; in fill_random_max_flow_graph()
111 property< vertex_predecessor_t, tVectorTraits::edge_descriptor, in test_adjacency_list_vecS()
116 property< edge_reverse_t, tVectorTraits::edge_descriptor > > > > in test_adjacency_list_vecS()
136 property< vertex_predecessor_t, tListTraits::edge_descriptor, in test_adjacency_list_listS()
141 property< edge_reverse_t, tListTraits::edge_descriptor > > > > in test_adjacency_list_listS()
180 typedef Node< tTraits::edge_descriptor > tVertex; in test_bundled_properties()
[all …]
|
| D | find_flow_cost_bundled_properties_and_named_params_test.cpp | 17 traits::edge_descriptor reversed_edge;
21 traits::edge_descriptor predecessor;
43 boost::property_map< Graph, traits::edge_descriptor edge_t::* >::type rev in BOOST_AUTO_TEST_CASE()
45 boost::property_map< Graph, traits::edge_descriptor node_t::* >::type pred in BOOST_AUTO_TEST_CASE()
79 boost::property_map< Graph, traits::edge_descriptor edge_t::* >::type rev in BOOST_AUTO_TEST_CASE()
81 boost::property_map< Graph, traits::edge_descriptor node_t::* >::type pred in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_mst_test.cpp | 69 typedef graph_traits<Graph>::edge_descriptor edge_descriptor; in test_distributed_dense_boruvka() typedef
88 std::vector<edge_descriptor> mst_edges; in test_distributed_dense_boruvka()
103 std::vector<edge_descriptor> mst_edges; in test_distributed_dense_boruvka()
119 std::vector<edge_descriptor> mst_edges; in test_distributed_dense_boruvka()
135 std::vector<edge_descriptor> mst_edges; in test_distributed_dense_boruvka()
|
| D | distributed_csr_test.cpp | 43 typedef graph_traits<Digraph>::edge_descriptor edge_descriptor; in concept_checks() typedef
66 ReadablePropertyGraphConcept<Digraph, edge_descriptor, edge_global_t> in concept_checks()
72 ReadablePropertyGraphConcept<Digraph, edge_descriptor, edge_index_t> in concept_checks()
|