| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 121 adjacent_vertices(*vertices(local_g1).first, local_g1); in test_main()
160 assert(*adjacent_vertices(u, g2).first == v); in test_main()
173 adjacent_vertices(*vertices(local_g2).first, local_g2); in test_main()
224 assert(*adjacent_vertices(u, g3).first == v); in test_main()
225 assert(*adjacent_vertices(v, g3).first == u); in test_main()
270 adjacent_vertices(*vertices(local_g3).first, local_g3); in test_main()
|
| /third_party/boost/libs/graph/example/ |
| D | knights_tour.cpp | 98 adjacent_vertices( in adjacent_vertices() function
135 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in backtracking_search()
164 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in number_of_successors()
193 for (boost::tie(i, end) = adjacent_vertices(x, g); i != end; ++i) in warnsdorff()
|
| D | vertex_basics.cpp | 117 for_each(adjacent_vertices(v, g).first, adjacent_vertices(v, g).second, in operator ()()
|
| D | family_tree.cpp | 47 boost::tie(ai, a_end) = adjacent_vertices(*i, g); in main()
|
| D | parallel-compile-time.cpp | 170 for (boost::tie(vi, vi_end) = adjacent_vertices(*i, g); vi != vi_end; in main()
185 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; in main()
|
| D | cycle-file-dep.cpp | 41 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi) in has_cycle_dfs()
|
| D | topo-sort-file-dep.cpp | 41 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi) in topo_sort_dfs()
|
| D | print-adjacent-vertices.cpp | 47 for (boost::tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi) in output_adjacent_vertices()
|
| D | implicit_graph.cpp | 312 std::pair< adjacency_iterator, adjacency_iterator > adjacent_vertices( in adjacent_vertices() function
500 for (boost::tie(ai, ai_end) = adjacent_vertices(u, g); ai != ai_end; in main()
|
| /third_party/boost/boost/graph/ |
| D | minimum_degree_ordering.hpp | 484 for (boost::tie(i, i_end) = adjacent_vertices(element, G); in eliminate()
498 for (boost::tie(v, ve) = adjacent_vertices(node, G); v != ve; ++v) in eliminate()
539 for (boost::tie(i, ie) = adjacent_vertices(current, G); i != ie; in update()
571 adj_iter nu = adjacent_vertices(u_node, G).first; in update()
581 for (boost::tie(i, ie) = adjacent_vertices(neighbor, G); in update()
639 for (boost::tie(i, ie) = adjacent_vertices(u_node, G); in update()
651 = adjacent_vertices(i_node, G); in update()
|
| D | clustering_coefficient.hpp | 73 boost::tie(i, end) = adjacent_vertices(v, g); in num_paths_through_vertex()
94 for (boost::tie(i, end) = adjacent_vertices(v, g); i != end; ++i) in num_triangles_on_vertex()
|
| D | hawick_circuits.hpp | 54 return adjacent_vertices( in operator ()()
78 adjacent_vertices(v, g).first, adjacent_vertices(v, g).second); in operator ()()
|
| D | iteration_macros.hpp | 119 = adjacent_vertices(UNAME, GNAME); \
133 = adjacent_vertices(UNAME, GNAME); \
|
| D | isomorphism.hpp | 304 num_edges_on_k -= count_if(adjacent_vertices(f[vk], G2), in match()
311 -= count(adjacent_vertices(f[j], G2), f[vk]); in match()
317 fi_adj = adjacent_vertices(f[i], G2); in match()
352 if (container_contains(adjacent_vertices(f[i], G2), f[j])) in match()
|
| D | transitive_closure.hpp | 101 for (boost::tie(v, v_end) = adjacent_vertices(u, g); v != v_end; in transitive_closure()
136 std::pair< cg_adj_iter, cg_adj_iter > pr = adjacent_vertices(i, CG); in transitive_closure()
256 for (boost::tie(ab, ae) = adjacent_vertices(*i, g); ab != ae; ++ab) in transitive_closure()
|
| D | sequential_vertex_coloring.hpp | 76 for (boost::tie(v, vend) = adjacent_vertices(current, G); v != vend; in sequential_vertex_coloring()
|
| D | create_condensation_graph.hpp | 41 for (boost::tie(v, v_end) = adjacent_vertices(u, g); v != v_end; in create_condensation_graph()
|
| D | smallest_last_ordering.hpp | 98 for (boost::tie(v, vend) = adjacent_vertices(node, G); v != vend; ++v) in smallest_last_vertex_ordering()
|
| /third_party/boost/libs/msm/example/mpl_graph/ |
| D | incidence_list_graph.cpp | 58 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::adjacent_vertices<A,some_graph>::type, mpl::vect…
59 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::adjacent_vertices<C,some_graph>::type, mpl::vect…
|
| D | adjacency_list_graph.cpp | 68 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::adjacent_vertices<A,some_graph>::type, mpl::vect…
69 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::adjacent_vertices<C,some_graph>::type, mpl::vect…
|
| /third_party/boost/libs/graph/test/ |
| D | graph_test.hpp | 150 std::pair< adj_iter, adj_iter > p = adjacent_vertices(u, g); in test_adjacency_graph()
256 = container_contains(adjacent_vertices(u, g), v); in test_add_edge()
299 deg_size_t occurances = count(adjacent_vertices(u, g), v); in test_remove_edge()
316 deg_size_t occurances = count(adjacent_vertices(u, g), v); in test_remove_edge()
321 BOOST_TEST(count(adjacent_vertices(u, g), v) + 1 == occurances); in test_remove_edge()
|
| D | adj_list_invalidation.cpp | 109 AdjIterator i = adjacent_vertices(*vertices(g).first, g).first; in invalidate_adj_verts()
|
| /third_party/boost/libs/mpi/src/ |
| D | graph_communicator.cpp | 36 adjacent_vertices(int vertex, const graph_communicator& comm) in adjacent_vertices() function
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | mpl_graph.hpp | 83 struct adjacent_vertices : struct
|
| /third_party/boost/boost/graph/distributed/ |
| D | vertex_list_adaptor.hpp | 274 adjacent_vertices(typename vertex_list_adaptor<Graph, GlobalIndexMap>::vertex_descriptor v, in adjacent_vertices() function
276 { return adjacent_vertices(v, g.base()); } in adjacent_vertices()
|