| /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()
62 BGL_FORALL_VERTICES_T(v, graph1_, Graph1) in operator ()()
72 const Graph1& graph1_;
370 template < typename Graph1, typename Graph2,
381 bool operator()(typename graph_traits< Graph1 >::edge_descriptor e1) in operator ()()
392 template < typename Graph1, typename Graph2,
398 typename graph_traits< Graph1 >::edge_descriptor e1) in edge2_predicate()
409 typename graph_traits< Graph1 >::edge_descriptor e1_;
420 template < typename Graph1, typename Graph2, typename IndexMap1,
[all …]
|
| D | isomorphism.hpp | 32 template < typename Graph1, typename Graph2, typename IsoMapping,
37 typedef typename graph_traits< Graph1 >::vertex_descriptor vertex1_t;
39 typedef typename graph_traits< Graph1 >::edge_descriptor edge1_t;
40 typedef typename graph_traits< Graph1 >::vertices_size_type size_type;
44 const Graph1& G1;
105 void discover_vertex(vertex1_t v, const Graph1&) const in discover_vertex()
109 void examine_edge(edge1_t e, const Graph1&) const in examine_edge()
119 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
134 const Graph1& G1;
139 isomorphism_algo(const Graph1& G1, const Graph2& G2, IsoMapping f, in isomorphism_algo()
[all …]
|
| D | copy.hpp | 114 template < typename Graph1, typename Graph2 > struct edge_copier
116 edge_copier(const Graph1& g1, Graph2& g2) in edge_copier()
126 add_reverse_edge_descriptor< Edge1, Graph1 >::convert(e1))); in operator ()()
128 typename property_map< Graph1, edge_all_t >::const_type edge_all_map1;
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()
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 50 bidirectionalS> Graph1; in test_main() typedef
63 Graph1 g1(20); in test_main()
68 graph_traits<Graph1>::vertex_iterator v, v_end; in test_main()
79 graph_traits<Graph1>::vertex_descriptor other = *v; in test_main()
92 graph_traits<Graph1>::vertex_iterator vi = vertices(g1).first; in test_main()
93 graph_traits<Graph1>::vertex_descriptor u = *vi++; in test_main()
94 graph_traits<Graph1>::vertex_descriptor v = *vi++; in test_main()
106 graph_traits<Graph1>::vertex_descriptor u = *vertices(g1).first; in test_main()
115 local_subgraph<Graph1> local_g1(g1); in test_main()
123 remove_out_edge_if(*vertices(g1).first, never<Graph1>(), g1); in test_main()
[all …]
|
| /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()
65 typedef typename graph_traits< Graph1 >::vertex_descriptor vertex1; in randomly_permute_graph()
67 typedef typename graph_traits< Graph1 >::vertex_iterator vertex_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()
190 BGL_FORALL_VERTICES_T(v, graph1_, Graph1) in operator ()()
201 const Graph1& graph1_;
|
| D | graph_concepts.cpp | 24 Graph1; in main() typedef
25 BOOST_CONCEPT_ASSERT((IncidenceGraphConcept< Graph1 >)); in main()
|
| D | adjacency_matrix_test.cpp | 51 template < typename Graph1, typename Graph2 > void run_test() in run_test()
53 typedef typename boost::property_map< Graph1, boost::vertex_index_t >::type in run_test()
58 Graph1 g1(24); in run_test()
150 typename boost::graph_traits< Graph1 >::vertex_iterator vi1, vend1; in run_test()
153 typename boost::graph_traits< Graph1 >::adjacency_iterator ai1, aend1; in run_test()
173 typename boost::graph_traits< Graph1 >::out_edge_iterator ei1, eend1; in run_test()
193 typename boost::graph_traits< Graph1 >::in_edge_iterator iei1, ieend1; in run_test()
215 BGL_FORALL_EDGES_T(e, g1, Graph1) in run_test()
231 typename boost::graph_traits< Graph1 >::directed_category*, in run_test()
|
| D | isomorphism.cpp | 59 template < typename Graph1, typename Graph2 >
60 void randomly_permute_graph(const Graph1& g1, Graph2& g2) in randomly_permute_graph()
66 typedef typename graph_traits< Graph1 >::vertex_descriptor vertex1; in randomly_permute_graph()
68 typedef typename graph_traits< Graph1 >::edge_iterator edge_iterator; in randomly_permute_graph()
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl-v3.w | 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,
510 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph1> ));
511 BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph1> ));
515 typedef typename graph_traits<Graph1>::vertex_descriptor vertex1_t;
517 typedef typename graph_traits<Graph1>::vertices_size_type size_type;
550 template <typename Graph1, typename Graph2, typename IsoMapping,
606 BGL_FORALL_VERTICES_T(v, G1, Graph1)
629 BGL_FORALL_VERTICES_T(v, G1, Graph1)
[all …]
|
| 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,
391 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph1> ));
392 BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph1> ));
396 typedef typename graph_traits<Graph1>::vertex_descriptor vertex1_t;
398 typedef typename graph_traits<Graph1>::vertices_size_type size_type;
428 template <typename Graph1, typename Graph2, typename IsoMapping,
484 BGL_FORALL_VERTICES_T(v, G1, Graph1)
508 BGL_FORALL_VERTICES_T(v, G1, Graph1)
[all …]
|
| D | isomorphism-impl.w | 243 template <typename Graph1, typename Graph2,
247 bool isomorphism(const Graph1& g1, const Graph2& g2,
282 typedef typename graph_traits<Graph1>::vertex_descriptor vertex1_t;
284 typedef typename graph_traits<Graph1>::vertices_size_type size_type;
285 typename graph_traits<Graph1>::vertex_iterator i1, i1_end;
291 \code{Graph1} type must be a \bglconcept{VertexListGraph} and a
304 BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph1> ));
305 BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph1> ));
522 (g1, *ui, detail::record_dfs_order<Graph1, IndexMap1>(perm,
538 template <typename Graph1, typename IndexMap1>
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | adjacency_list_io.cpp | 76 Graph1; typedef
85 Graph1 g1; in main()
|