| /third_party/boost/boost/graph/ |
| D | boykov_kolmogorov_max_flow.hpp | 96 : m_g(g) in bk_max_flow()
122 for (boost::tie(vi, v_end) = vertices(m_g); vi != v_end; ++vi) in bk_max_flow()
129 for (boost::tie(ei, e_end) = edges(m_g); ei != e_end; ++ei) in bk_max_flow()
177 for (boost::tie(ei, e_end) = out_edges(m_source, m_g); ei != e_end; in augment_direct_paths()
181 vertex_descriptor current_node = target(from_source, m_g); in augment_direct_paths()
192 = lookup_edge(current_node, m_sink, m_g); in augment_direct_paths()
240 for (boost::tie(ei, e_end) = out_edges(m_sink, m_g); ei != e_end; in augment_direct_paths()
244 vertex_descriptor current_node = source(to_sink, m_g); in augment_direct_paths()
282 = out_edges(current_node, m_g); in grow()
291 = target(out_edge, m_g); in grow()
[all …]
|
| D | filtered_graph.hpp | 75 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in out_edge_predicate()
81 return m_edge_pred(e) && m_vertex_pred(target(e, *m_g)); in operator ()()
85 const Graph* m_g; member
94 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in in_edge_predicate()
100 return m_edge_pred(e) && m_vertex_pred(source(e, *m_g)); in operator ()()
104 const Graph* m_g; member
113 : m_edge_pred(ep), m_vertex_pred(vp), m_g(&g) in edge_predicate()
119 return m_edge_pred(e) && m_vertex_pred(source(e, *m_g)) in operator ()()
120 && m_vertex_pred(target(e, *m_g)); in operator ()()
124 const Graph* m_g; member
[all …]
|
| D | reverse_graph.hpp | 154 reverse_graph(GraphRef g) : m_g(g) {} in reverse_graph()
159 : m_g(o.m_g) in reverse_graph()
214 return m_g[detail::get_underlying_descriptor_from_reverse_descriptor< in operator []()
224 return m_g[detail::get_underlying_descriptor_from_reverse_descriptor< in operator []()
233 GraphRef m_g; member in boost::reverse_graph
296 return vertices(g.m_g); in vertices()
306 edges(g.m_g)); in edges()
319 in_edges(u, g.m_g)); in out_edges()
326 return num_vertices(g.m_g); in num_vertices()
333 return num_edges(g.m_g); in num_edges()
[all …]
|
| D | adjacency_iterator.hpp | 33 : super_t(i), m_g(g) in adjacency_iterator()
37 inline Vertex dereference() const { return target(*this->base(), *m_g); } in dereference()
39 const Graph* m_g; member
69 : super_t(i), m_g(g) in inv_adjacency_iterator()
73 inline Vertex dereference() const { return source(*this->base(), *m_g); } in dereference()
75 const Graph* m_g; member
|
| D | graph_utility.hpp | 71 incident_from_predicate(Vertex u, const Graph& g) : m_u(u), m_g(g) {} in incident_from_predicate()
74 return source(e, m_g) == m_u; in operator ()()
77 const Graph& m_g; member
88 incident_to_predicate(Vertex u, const Graph& g) : m_u(u), m_g(g) {} in incident_to_predicate()
91 return target(e, m_g) == m_u; in operator ()()
94 const Graph& m_g; member
105 incident_on_predicate(Vertex u, const Graph& g) : m_u(u), m_g(g) {} in incident_on_predicate()
108 return source(e, m_g) == m_u || target(e, m_g) == m_u; in operator ()()
111 const Graph& m_g; member
123 : m_u(u), m_v(v), m_g(g) in connects_predicate()
[all …]
|
| D | howard_cycle_ratio.hpp | 150 : m_g(g) in mcr_howard()
156 , m_V(num_vertices(m_g)) in mcr_howard()
215 for (boost::tie(vi, vie) = vertices(m_g); vi != vie; ++vi) in mcr_bound()
217 for (boost::tie(oei, oeie) = out_edges(*vi, m_g); oei != oeie; in mcr_bound()
239 for (boost::tie(vi, vie) = vertices(m_g); vi != vie; ++vi) in construct_policy_graph()
241 boost::tie(oei, oeie) = out_edges(*vi, m_g); in construct_policy_graph()
258 m_inel[target(*mei, m_g)].push_back(*vi); in construct_policy_graph()
313 gv = target(m_policy[gv], m_g); in find_cycle_vertex()
338 v = target(m_policy[v], m_g); in cycle_ratio()
357 boost::tie(uv_itr, vie) = vertices(m_g); in policy_mcr()
[all …]
|
| D | graphml.hpp | 83 : m_g(g), m_dp(dp) in mutate_graph_impl()
94 virtual any do_add_vertex() { return any(add_vertex(m_g)); } in do_add_vertex()
100 any_cast< vertex_descriptor >(target), m_g); in do_add_edge()
111 put_property< MutableGraph*, value_types >(name, m_dp, &m_g, in set_graph_property()
210 MutableGraph& m_g; member in boost::mutate_graph_impl
|
| D | properties.hpp | 278 degree_property_map(const Graph& g) : m_g(g) {} in degree_property_map()
279 value_type operator[](const key_type& v) const { return degree(v, m_g); } in operator []()
282 const Graph& m_g; member in boost::degree_property_map
|
| D | subgraph.hpp | 898 subgraph_global_property_map(GraphPtr g, Tag tag) : m_g(g), m_tag(tag) {} in subgraph_global_property_map()
902 PropertyMap pmap = get(m_tag, m_g->root().m_graph); in operator []()
903 return m_g->is_root() ? pmap[e] : pmap[m_g->local_to_global(e)]; in operator []()
906 GraphPtr m_g; member in boost::subgraph_global_property_map
934 subgraph_local_property_map(GraphPtr g, Tag tag) : m_g(g), m_tag(tag) {} in subgraph_local_property_map()
939 PropertyMap pmap = get(m_tag, m_g->m_graph); in operator []()
943 GraphPtr m_g; member in boost::subgraph_local_property_map
|
| D | max_cardinality_matching.hpp | 566 less_than_by_degree(const Graph& g) : m_g(g) {} in less_than_by_degree()
569 return out_degree(PairSelector::select_vertex(x), m_g) in operator ()()
570 < out_degree(PairSelector::select_vertex(y), m_g); in operator ()()
574 const Graph& m_g; member in boost::extra_greedy_matching::less_than_by_degree
|
| D | isomorphism.hpp | 444 , m_g(g) in degree_vertex_invariant()
457 return (m_max_vertex_in_degree + 1) * out_degree(v, m_g) in operator ()()
470 const Graph& m_g; member in boost::degree_vertex_invariant
|
| /third_party/boost/boost/graph/detail/ |
| D | adj_list_edge_iterator.hpp | 55 , m_g(x.m_g) in adj_list_edge_iterator()
62 : vBegin(b), vCurr(c), vEnd(e), m_g(&g) in adj_list_edge_iterator()
66 while (vCurr != vEnd && out_degree(*vCurr, *m_g) == 0) in adj_list_edge_iterator()
69 edges = out_edges(*vCurr, *m_g); in adj_list_edge_iterator()
84 while (vCurr != vEnd && out_degree(*vCurr, *m_g) == 0) in operator ++()
87 edges = out_edges(*vCurr, *m_g); in operator ++()
126 const Graph* m_g; member in boost::detail::adj_list_edge_iterator
|
| D | sparse_ordering.hpp | 194 out_degree_property_map(const Graph& g) : m_g(g) {} in out_degree_property_map()
197 return out_degree(v, m_g); in operator []()
201 const Graph& m_g; member in boost::out_degree_property_map
|
| /third_party/boost/boost/ |
| D | generator_iterator.hpp | 40 generator_iterator(Generator* g) : m_g(g), m_value((*m_g)()) {} in generator_iterator()
44 m_value = (*m_g)(); in increment()
55 return this->m_g == y.m_g && this->m_value == y.m_value; in equal()
59 Generator* m_g; member in boost::iterators::generator_iterator
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | serialization.hpp | 156 : m_g(g) in graph_loader()
167 ar >> make_nvp("distribution", m_g.distribution()); in graph_loader()
246 Graph& m_g; member
317 m_g.distribution().assign_mapping( in load_prefix()
352 vertex_descriptor v(process_id(m_pg), add_vertex(property, m_g.base())); in maybe_load_and_store_local_vertex()
354 if (m_g.on_add_vertex) in maybe_load_and_store_local_vertex()
355 m_g.on_add_vertex(v, m_g); in maybe_load_and_store_local_vertex()
372 add_vertex(m_g.build_vertex_property(property), in maybe_load_and_store_local_vertex()
373 m_g.base())); in maybe_load_and_store_local_vertex()
375 if (m_g.on_add_vertex) in maybe_load_and_store_local_vertex()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | bellman-example.cpp | 20 edge_writer(const Graph& g, const ParentMap& p) : m_g(g), m_parent(p) {} in edge_writer()
25 out << "[label=\"" << get(edge_weight, m_g, e) << "\""; in operator ()()
26 typename graph_traits< Graph >::vertex_descriptor u = source(e, m_g), in operator ()()
27 v = target(e, m_g); in operator ()()
34 const Graph& m_g; member
|
| D | implicit_graph.cpp | 345 : ring_edge_iterator::iterator_adaptor_(0), m_g(NULL) {}; in ring_edge_iterator()
347 : ring_edge_iterator::iterator_adaptor_(vertices(g).first), m_g(&g) {}; in ring_edge_iterator()
352 , m_g(&g) {}; in ring_edge_iterator()
360 return *(out_edges(*this->base_reference(), *m_g).first); in dereference()
364 const ring_graph* m_g; member in ring_edge_iterator
|
| D | knights_tour.cpp | 38 : m_pos(p), m_g(&g), m_i(ii) in knight_adjacency_iterator()
56 const knights_tour_graph* m_g; member
88 || new_pos.first >= m_g->m_board_size in valid_position()
89 || new_pos.second >= m_g->m_board_size)) in valid_position()
|
| /third_party/boost/libs/graph/src/ |
| D | graphml.cpp | 30 graphml_reader(mutate_graph& g) : m_g(g) {} in graphml_reader()
167 if (is_directed != m_g.is_directed()) in run()
213 m_vertex[v] = m_g.do_add_vertex(); in handle_vertex()
242 boost::tie(edge, added) = m_g.do_add_edge(source, target); in handle_edge()
272 m_g.set_graph_property(m_key_name[key_id], value, m_key_type[key_id]); in handle_graph_property()
278 m_g.set_vertex_property(m_key_name[key_id], m_vertex[descriptor], value, in handle_node_property()
285 m_g.set_edge_property( in handle_edge_property()
289 mutate_graph& m_g; member in __anon65dad4a70111::graphml_reader
|
| /third_party/boost/libs/graph/test/ |
| D | min_cost_max_flow_utils.hpp | 44 : m_g(g), m_w(w), m_cap(c), m_rev(rev) in EdgeAdder()
63 boost::tie(e, b) = add_edge(vertex(v, m_g), vertex(w, m_g), m_g); in add()
74 Graph& m_g; member in boost::SampleGraph::EdgeAdder
|
| D | boykov_kolmogorov_max_flow_test.cpp | 279 for (boost::tie(ei, e_end) = out_edges(v, tSuper::m_g); ei != e_end; in invariant_four()
282 const tVertex& other_node = target(*ei, tSuper::m_g); in invariant_four()
321 ? source(e, tSuper::m_g) in invariant_six()
322 : target(e, tSuper::m_g); in invariant_six()
343 ? source(e, tSuper::m_g) in invariant_seven()
344 : target(e, tSuper::m_g); in invariant_seven()
364 ? source(e, tSuper::m_g) in invariant_eight()
365 : target(e, tSuper::m_g); in invariant_eight()
375 for (boost::tie(vi, v_end) = vertices(tSuper::m_g); vi != v_end; ++vi) in check_invariants()
413 for (boost::tie(ei, e_end) = out_edges(this->m_source, this->m_g); in test()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | filtered_graph.hpp | 39 return process_group(g.m_g); in process_group()
47 { return vertex(i, g.m_g); } in vertex()
|
| D | reverse_graph.hpp | 34 return process_group(g.m_g); in process_group()
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl.w | 354 : m_in_degree_map(in_degree_map), m_g(g) { }
357 return (num_vertices(m_g) + 1) * out_degree(v, m_g)
362 return num_vertices(m_g) * num_vertices(m_g) + num_vertices(m_g);
366 const Graph& m_g;
597 : m_index_map(vip), m_g(g) { }
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
603 const Graph& m_g;
|
| D | isomorphism-impl-v2.w | 774 : m_in_degree_map(in_degree_map), m_g(g) { }
777 return (num_vertices(m_g) + 1) * out_degree(v, m_g)
782 return num_vertices(m_g) * num_vertices(m_g) + num_vertices(m_g);
786 const Graph& m_g;
|