Lines Matching refs:Graph2

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;
739 isomorphism_algo(const Graph1& G1, const Graph2& G2, IsoMapping f,
828 BGL_FORALL_VERTICES_T(y, G2, Graph2) {
853 BGL_FORALL_ADJACENT_T(f[k], w, G2, Graph2)
862     BGL_FORALL_ADJACENT_T(f[j], w, G2, Graph2)
870 BGL_FORALL_ADJACENT_T(f[u], y, G2, Graph2)
888 BGL_FORALL_ADJACENT_T(f[u], y, G2, Graph2) {
954 template <typename Graph1, typename Graph2,
958 bool isomorphism_impl(const Graph1& G1, const Graph2& G2,
973   degree_vertex_invariant<InDeg2, Graph2> invariant2(in_degree2, G2);
987 template <typename Graph1, typename Graph2, class P, class T, class R>
989 		 const Graph2& g2,
992   typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
1008 template <typename Graph1, typename Graph2>
1009 bool isomorphism(const Graph1& g1, const Graph2& g2)
1021 template<typename Graph1, typename Graph2, typename IsoMap>
1022 inline bool verify_isomorphism(const Graph1& g1, const Graph2& g2, IsoMap iso_map)
1030     for (typename graph_traits<Graph2>::edge_iterator e2 = edges(g2).first;