| /third_party/boost/boost/graph/distributed/ |
| D | distributed_graph_utility.hpp | 36 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in property_on_outedges()
45 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in property_on_successors()
64 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in property_on_adjacents()
|
| D | hohberg_biconnected_components.hpp | 407 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in initialize_leader()
465 BGL_FORALL_OUTEDGES_T(alpha, oe, g, Graph) { in operator ()()
612 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in operator ()()
641 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in num_starting_bicomponents()
666 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in fill_edge_map()
707 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in start_naming_phase()
759 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in echo_phase()
828 BGL_FORALL_OUTEDGES_T(alpha, e, g, Graph) { in echo_phase()
870 BGL_FORALL_OUTEDGES_T(target(e, g), oe, g, Graph) { in get_edge_index()
883 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) { in get_incident_edge_index()
|
| D | boman_et_al_graph_coloring.hpp | 186 BGL_FORALL_OUTEDGES_T(*first, e, g, DistributedGraph) { in boman_et_al_graph_coloring()
203 BGL_FORALL_OUTEDGES_T(*first, e, g, DistributedGraph) { in boman_et_al_graph_coloring()
236 BGL_FORALL_OUTEDGES_T(v, e, g, DistributedGraph) { in boman_et_al_graph_coloring()
|
| D | delta_stepping_shortest_paths.hpp | 208 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in delta_stepping_impl()
320 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in run()
342 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in run()
|
| D | st_connected.hpp | 91 BGL_FORALL_OUTEDGES_T(u, e, g, DistributedGraph) { in st_connected()
|
| D | dijkstra_shortest_paths.hpp | 115 BGL_FORALL_OUTEDGES_T(u, e, g, DistributedGraph) in run_impl()
|
| D | betweenness_centrality.hpp | 405 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in run()
427 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in run()
669 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in set_delta()
|
| D | crauser_et_al_shortest_paths.hpp | 435 BGL_FORALL_OUTEDGES_T(v, e, g, Graph) { in initialize_min_in_weights()
|
| /third_party/boost/boost/graph/ |
| D | edge_coloring.hpp | 39 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in is_free()
63 BGL_FORALL_OUTEDGES_T(x, e, g, Graph) in maximal_fan()
95 BGL_FORALL_OUTEDGES_T(x, e, g, Graph) in invert_cd_path()
111 BGL_FORALL_OUTEDGES_T(x, e, g, Graph) in invert_cd_path()
|
| D | st_connected.hpp | 50 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in st_connected()
|
| D | random.hpp | 99 BGL_FORALL_OUTEDGES_T(src, e, g, Graph) { weight_sum += get(weight, e); } in weighted_random_out_edge()
104 BGL_FORALL_OUTEDGES_T(src, e, g, Graph) in weighted_random_out_edge()
|
| D | mcgregor_common_subgraphs.hpp | 169 BGL_FORALL_OUTEDGES_T(existing_vertex1, edge1, graph1, GraphFirst) in can_extend_graph()
180 BGL_FORALL_OUTEDGES_T(existing_vertex2, edge2, graph2, GraphSecond) in can_extend_graph()
220 BGL_FORALL_OUTEDGES_T( in can_extend_graph()
236 BGL_FORALL_OUTEDGES_T( in can_extend_graph()
|
| D | maximum_adjacency_search.hpp | 162 BGL_FORALL_OUTEDGES_T(u, e, g, Graph) in maximum_adjacency_search()
188 BGL_FORALL_OUTEDGES_T(uPrime, e, g, Graph) in maximum_adjacency_search()
|
| D | vf2_sub_graph_iso.hpp | 178 BGL_FORALL_OUTEDGES_T(v_this, e, graph_this_, GraphThis) in push()
226 BGL_FORALL_OUTEDGES_T(v_this, e, graph_this_, GraphThis) in pop()
329 BGL_FORALL_OUTEDGES_T(s, e, g, Graph) in operator ()()
550 BGL_FORALL_OUTEDGES_T(v_new, e1, graph1_, Graph1) in feasible()
620 BGL_FORALL_OUTEDGES_T(w_new, e2, graph2_, Graph2) in feasible()
|
| D | graph_stats.hpp | 128 BGL_FORALL_OUTEDGES_T(v, e, g, Graph) { tmp += em[e]; } in weight_degree_dist()
|
| D | dijkstra_shortest_paths_no_color_map.hpp | 82 BGL_FORALL_OUTEDGES_T(min_vertex, current_edge, graph, Graph) in dijkstra_shortest_paths_no_color_map_no_init()
|
| D | iteration_macros.hpp | 142 #define BGL_FORALL_OUTEDGES_T(UNAME, ENAME, GNAME, GraphType) \ macro
|
| D | astar_search.hpp | 322 BGL_FORALL_OUTEDGES_T(v, e, g, VertexListGraph) in astar_search_no_init_tree()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_shortest_paths_test.cpp | 118 BGL_FORALL_OUTEDGES_T(v, e, g, Graph) { in verify_shortest_paths()
126 BGL_FORALL_OUTEDGES_T(v, e, g, Graph) { in verify_shortest_paths()
|
| /third_party/boost/boost/mpi/ |
| D | graph_communicator.hpp | 227 BGL_FORALL_OUTEDGES_T(v, e, graph, Graph) in setup_graph()
|
| /third_party/boost/libs/graph/test/ |
| D | bundled_properties.cpp | 145 BGL_FORALL_OUTEDGES_T(v, e, map, Map) in test_io()
|
| D | mcgregor_subgraphs_test.cpp | 287 BGL_FORALL_OUTEDGES_T(source_vertex, edge, graph, Graph) in add_random_vertices()
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | redistribute.hpp | 217 BGL_FORALL_OUTEDGES_T(*vi, e, *this, graph_type) in redistribute()
|