| /third_party/boost/boost/graph/ |
| D | vf2_sub_graph_iso.hpp | 49 template < typename Graph1, typename Graph2 > struct vf2_print_callback
52 vf2_print_callback(const Graph1& graph1, const Graph2& graph2) in vf2_print_callback()
73 const Graph2& graph2_;
370 template < typename Graph1, typename Graph2,
376 typename graph_traits< Graph2 >::edge_descriptor e2) in edge1_predicate()
387 typename graph_traits< Graph2 >::edge_descriptor e2_;
392 template < typename Graph1, typename Graph2,
403 bool operator()(typename graph_traits< Graph2 >::edge_descriptor e2) in operator ()()
420 template < typename Graph1, typename Graph2, typename IndexMap1,
428 typedef typename graph_traits< Graph2 >::vertex_descriptor vertex2_type;
[all …]
|
| D | isomorphism.hpp | 32 template < typename Graph1, typename Graph2, typename IsoMapping,
38 typedef typename graph_traits< Graph2 >::vertex_descriptor vertex2_t;
45 const Graph2& G2;
139 isomorphism_algo(const Graph1& G1, const Graph2& G2, IsoMapping f, in isomorphism_algo()
166 f[v] = graph_traits< Graph2 >::null_vertex(); in test_isomorphism()
175 BGL_FORALL_VERTICES_T(v, G2, Graph2) in test_isomorphism()
241 typedef typename graph_traits< Graph2 >::vertex_iterator
244 typedef typename graph_traits< Graph2 >::adjacency_iterator
254 typedef typename graph_traits< Graph2 >::vertex_iterator in match()
258 typedef typename graph_traits< Graph2 >::adjacency_iterator in match()
[all …]
|
| D | copy.hpp | 114 template < typename Graph1, typename Graph2 > struct edge_copier
116 edge_copier(const Graph1& g1, Graph2& g2) in edge_copier()
129 mutable typename property_map< Graph2, edge_all_t >::type edge_all_map2;
131 template < typename Graph1, typename Graph2 >
132 inline edge_copier< Graph1, Graph2 > make_edge_copier( in make_edge_copier()
133 const Graph1& g1, Graph2& g2) in make_edge_copier()
135 return edge_copier< Graph1, Graph2 >(g1, g2); in make_edge_copier()
138 template < typename Graph1, typename Graph2 > struct vertex_copier
140 vertex_copier(const Graph1& g1, Graph2& g2) in vertex_copier()
154 typename property_map< Graph2, vertex_all_t >::type vertex_all_map2;
[all …]
|
| D | johnson_all_pairs_shortest.hpp | 55 Graph2; in johnson_all_pairs_shortest_paths() typedef
56 typedef graph_traits< Graph2 > Traits2; in johnson_all_pairs_shortest_paths()
58 Graph2 g2(num_vertices(g1) + 1); in johnson_all_pairs_shortest_paths()
59 typename property_map< Graph2, edge_weight_t >::type w in johnson_all_pairs_shortest_paths()
61 typename property_map< Graph2, edge_weight2_t >::type w_hat in johnson_all_pairs_shortest_paths()
63 typename property_map< Graph2, vertex_distance_t >::type d in johnson_all_pairs_shortest_paths()
65 typedef typename property_map< Graph2, vertex_index_t >::type VertexID2; in johnson_all_pairs_shortest_paths()
|
| /third_party/boost/libs/graph/example/ |
| D | adjacency_list_io.cpp | 80 Graph2; typedef
91 Graph2 g2; in main()
97 Graph2 g21; in main()
104 Graph2 g31; in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 52 directedS> Graph2; in test_main() typedef
138 Graph2 g2(20); in test_main()
143 graph_traits<Graph2>::vertex_iterator v, v_end; in test_main()
155 graph_traits<Graph2>::vertex_iterator vi = vertices(g2).first; in test_main()
156 graph_traits<Graph2>::vertex_descriptor u = *vi++; in test_main()
157 graph_traits<Graph2>::vertex_descriptor v = *vi++; in test_main()
168 local_subgraph<Graph2> local_g2(g2); in test_main()
174 remove_out_edge_if(*vertices(g2).first, never<Graph2>(), g2); in test_main()
178 remove_edge_if(never<Graph2>(), g2); in test_main()
|
| D | distributed_strong_components_test.cpp | 123 typedef adjacency_list<listS, vecS, directedS> Graph2; in test_distributed_strong_components() typedef
127 Graph2 g2(erdos_renyi_iterator<minstd_rand, Graph>(gen, n, _p/2), in test_distributed_strong_components()
|
| D | distributed_connected_components_test.cpp | 140 no_property > Graph2; in test_distributed_connected_components() typedef
148 Graph2 g2( sorted_unique_rmat_iterator<minstd_rand, Graph>(gen, n, m, a, b, c, d, true), in test_distributed_connected_components()
|
| /third_party/boost/libs/graph/test/ |
| D | vf2_sub_graph_iso_test.cpp | 59 template < typename Graph1, typename Graph2 >
60 void randomly_permute_graph(Graph1& g1, const Graph2& g2) in randomly_permute_graph()
66 typedef typename graph_traits< Graph2 >::vertex_descriptor vertex2; in randomly_permute_graph()
68 typedef typename graph_traits< Graph2 >::edge_iterator edge_iterator; in randomly_permute_graph()
160 template < typename Graph1, typename Graph2, typename EdgeEquivalencePredicate,
165 test_callback(const Graph1& graph1, const Graph2& graph2, in test_callback()
202 const Graph2& graph2_;
|
| D | adjacency_matrix_test.cpp | 51 template < typename Graph1, typename Graph2 > void run_test() in run_test()
55 typedef typename boost::property_map< Graph2, boost::vertex_index_t >::type in run_test()
59 Graph2 g2(24); in run_test()
151 typename boost::graph_traits< Graph2 >::vertex_iterator vi2, vend2; in run_test()
154 typename boost::graph_traits< Graph2 >::adjacency_iterator ai2, aend2; in run_test()
174 typename boost::graph_traits< Graph2 >::out_edge_iterator ei2, eend2; in run_test()
194 typename boost::graph_traits< Graph2 >::in_edge_iterator iei2, ieend2; in run_test()
220 Graph2 g3(edge_pairs_g1.begin(), edge_pairs_g1.end(), num_vertices(g1)); in run_test()
224 BGL_FORALL_EDGES_T(e, g3, Graph2) in run_test()
234 typename boost::graph_traits< Graph2 >::directed_category*, in run_test()
|
| D | graph_concepts.cpp | 29 Graph2; in main() typedef
30 BOOST_CONCEPT_ASSERT((AdjacencyGraphConcept< Graph2 >)); in main()
|
| D | isomorphism.cpp | 59 template < typename Graph1, typename Graph2 >
60 void randomly_permute_graph(const Graph1& g1, Graph2& g2) in randomly_permute_graph()
67 typedef typename graph_traits< Graph2 >::vertex_descriptor vertex2; in randomly_permute_graph()
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl-v2.w | 327 template <typename Graph1, typename Graph2, typename IsoMapping,
330 bool isomorphism(const Graph1& G1, const Graph2& G2, IsoMapping f,
354 detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2,
393 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph2> ));
394 BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph2> ));
397 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
428 template <typename Graph1, typename Graph2, typename IsoMapping,
489 BGL_FORALL_VERTICES_T(v, G2, Graph2)
693 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
703 const Graph2& G2;
[all …]
|
| D | isomorphism-impl-v3.w | 323 BGL_FORALL_VERTICES_T(u, G2, Graph2) {
388 BGL_FORALL_ADJ_T(f[i], v, G2, Graph2)
410 typename graph_traits<Graph2>::out_edge_iterator io, io_end;
443 template <typename Graph1, typename Graph2, typename IsoMapping,
446 bool isomorphism(const Graph1& G1, const Graph2& G2, IsoMapping f,
470 detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1,
512 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph2> ));
513 BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph2> ));
516 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
550 template <typename Graph1, typename Graph2, typename IsoMapping,
[all …]
|
| D | isomorphism-impl.w | 243 template <typename Graph1, typename Graph2,
247 bool isomorphism(const Graph1& g1, const Graph2& g2,
283 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
286 typename graph_traits<Graph2>::vertex_iterator i2, i2_end;
292 \bglconcept{EdgeListGraph}. The \code{Graph2} type must be a
306 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph2> ));
307 BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph2> ));
648 template <class VertexIter, class EdgeIter, class Graph1, class Graph2,
653 const Graph1& g1, const Graph2& g2,
679 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
[all …]
|