| /third_party/boost/boost/mpi/ |
| D | graph_communicator.hpp | 361 comm_edge_iterator(int nedges) : edge_index(nedges) { } in comm_edge_iterator()
364 : indices(indices), edges(edges), edge_index(0), edge(0, 0) in comm_edge_iterator()
372 while (edge_index == indices[edge.first]) in dereference()
374 edge.second = edges[edge_index]; in dereference()
380 return edge_index == other.edge_index; in equal()
385 ++edge_index; in increment()
390 int edge_index; member in boost::mpi::detail::comm_edge_iterator
|
| /third_party/boost/boost/graph/ |
| D | grid_graph.hpp | 233 typename graph_traits< Graph >::edges_size_type edge_index) const in operator ()()
235 return (edge_at(edge_index, *m_graph)); in operator ()()
488 edge_descriptor edge_at(edges_size_type edge_index) const in edge_at()
495 while (edge_index >= dimension_edges) in edge_at()
497 edge_index -= dimension_edges; in edge_at()
504 = ((edge_index / (num_edges(dimension_index) / 2)) == 0); in edge_at()
508 vertex_source = vertex_at(edge_index % num_vertices()); in edge_at()
524 = edge_index % num_edges(dimension_index); in edge_at()
582 edges_size_type edge_index = 0; in index_of() local
590 edge_index += num_edges(dimension_index); in index_of()
[all …]
|
| D | undirected_graph.hpp | 205 boost::put(edge_index, m_graph, x.first, m_max_edge_index); in make_index()
287 edge_index_type n = get(edge_index, m_graph, *i); in remove_edge_and_renumber_indices()
362 IndexMap indices = get(edge_index, m_graph); in renumber_edge_indices()
722 get(edge_index, g.impl(), k), v)); in put()
780 return get(edge_index, g, v); in get_edge_index()
|
| D | directed_graph.hpp | 202 boost::put(edge_index, m_graph, x.first, m_max_edge_index); in make_index()
284 edge_index_type n = get(edge_index, m_graph, *i); in remove_edge_and_renumber_indices()
359 IndexMap indices = get(edge_index, m_graph); in renumber_edge_indices()
697 get(edge_index, g.impl(), k), v)); in put()
754 return get(edge_index, g, v); in get_edge_index()
|
| D | boyer_myrvold_planar_test.hpp | 96 edge_default_index_map_t e_d_map = get(edge_index, g); in dispatched_boyer_myrvold()
174 edge_default_index_map_t e_d_map = get(edge_index, g); in dispatched_boyer_myrvold()
|
| D | subgraph.hpp | 223 : m_global_edge[get(get(edge_index, m_graph), e_local)]; in local_to_global()
230 get(get(edge_index, root().m_graph), e_global))) in global_to_local()
254 = m_local_edge.find(get(get(edge_index, root().m_graph), e_global)); in find_edge()
383 put(edge_index, m_graph, e_local, m_edge_counter++); in local_add_edge()
385 m_local_edge[get(get(edge_index, this->root()), e_global)] = e_local; in local_add_edge()
644 put(edge_index, g.m_graph, e_global, g.m_edge_counter++); in add_edge_recur_up()
|
| D | bc_clustering.hpp | 163 make_iterator_property_map(edge_centrality.begin(), get(edge_index, g)), in betweenness_centrality_clustering()
|
| D | make_biconnected_planar.hpp | 91 make_biconnected_planar(g, embedding, get(edge_index, g)); in make_biconnected_planar()
|
| /third_party/boost/libs/graph/test/ |
| D | grid_graph_test.cpp | 91 for (edges_size_type edge_index = 0; edge_index < num_edges(graph); in do_test() local
92 ++edge_index) in do_test()
95 edge_descriptor current_edge = edge_at(edge_index, graph); in do_test()
97 get(boost::edge_index, graph, current_edge) == edge_index); in do_test()
|
| D | parallel_edges_loops_test.cpp | 182 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in test_graph()
198 edge_visitor_t edge_updater(get(edge_index, g), num_edges(g)); in test_graph()
237 make_biconnected_planar(g, perm, get(edge_index, g), edge_updater); in test_graph()
245 g, perm, get(vertex_index, g), get(edge_index, g), edge_updater); in test_graph()
253 planar_face_traversal(g, perm, vis, get(edge_index, g)); in test_graph()
|
| D | random_spanning_tree_test.cpp | 36 edge_style(num_edges(g), get(edge_index, g)); in write_spanning_tree()
73 weight(num_edges(g), get(edge_index, g)); in main()
77 put(weight, e, (1. + get(edge_index, g, e)) / num_edges(g)); in main()
|
| D | all_planar_input_files_test.cpp | 119 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in test_graph()
135 edge_visitor_t edge_updater(get(edge_index, g), num_edges(g)); in test_graph()
174 make_biconnected_planar(g, perm, get(edge_index, g), edge_updater); in test_graph()
182 g, perm, get(vertex_index, g), get(edge_index, g), edge_updater); in test_graph()
|
| D | make_bicon_planar_test.cpp | 23 = get(edge_index, g); in reset_edge_index()
87 g, make_vector_property_map< int >(get(edge_index, g))) in test_line_graph()
93 g, make_vector_property_map< int >(get(edge_index, g))) in test_line_graph()
|
| D | betweenness_centrality_test.cpp | 110 put(edge_index, g, edges[e], e); in run_unweighted_test()
120 edge_centrality1.begin(), get(edge_index, g), double())) in run_unweighted_test()
131 edge_centrality2.begin(), get(edge_index, g), double()))); in run_unweighted_test()
136 edge_centrality3.begin(), get(edge_index, g), double()))); in run_unweighted_test()
|
| D | subgraph.cpp | 34 BOOST_TEST(get(boost::edge_index, g1, *e1_i) in sub_cmp()
35 == get(boost::edge_index, g2, *e2_i)); in sub_cmp()
|
| D | cycle_ratio_tests.cpp | 184 BGL_FORALL_EDGES_T(ed, g, TG) { put(edge_index, g, ed, i++); } in read_data1()
256 double maxmc = maximum_cycle_mean(tgi, vim, ew1m, get(edge_index, tgi)); in main()
|
| /third_party/boost/boost/graph/detail/ |
| D | index.hpp | 54 return get(edge_index, g); in index_map()
57 static map_type index_map(Graph& g) { return get(edge_index, g); } in index_map()
61 return get(edge_index, g, k); in index()
|
| D | indexed_properties.hpp | 159 return m_edge_properties[get(edge_index, derived(), v)]; in operator []()
164 return m_edge_properties[get(edge_index, derived(), v)]; in operator []()
|
| /third_party/boost/libs/graph/example/ |
| D | make_biconnected_planar.cpp | 44 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in main()
66 component_map_t component(component_storage.begin(), get(edge_index, g)); in main()
83 component = component_map_t(component_storage.begin(), get(edge_index, g)); in main()
|
| D | subgraph.cpp | 92 print_edges2(G0, get(vertex_index, G0), get(edge_index, G0)); in main()
101 print_edges2(*ci, get(vertex_index, *ci), get(edge_index, *ci)); in main()
|
| D | bellman-ford-internet.cpp | 58 make_iterator_property_map(&delay[0], get(edge_index, g), delay[0])) in main()
|
| D | grid_graph_example.cpp | 53 << get(boost::edge_index, graph, edge_at(e_index, graph)) in main()
|
| D | kuratowski_subgraph.cpp | 48 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in main()
|
| D | canonical_ordering.cpp | 47 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in main()
|
| D | planar_face_traversal.cpp | 74 property_map< graph, edge_index_t >::type e_index = get(edge_index, g); in main()
|