Lines Matching refs:Graph2

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,
611     BGL_FORALL_VERTICES_T(v, G2, Graph2)
751 typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
753 typedef typename graph_traits<Graph2>::edge_descriptor edge2_t;
762 const Graph2& G2;
793 isomorphism_algo(const Graph1& G1, const Graph2& G2, IsoMapping f,
866 template <typename Graph1, typename Graph2,
870 bool isomorphism_impl(const Graph1& G1, const Graph2& G2,
887   degree_vertex_invariant<InDeg2, Graph2> invariant2(in_degree2, G2);
904 template <typename Graph1, typename Graph2, class P, class T, class R>
906                  const Graph2& g2,
909   typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
925 template <typename Graph1, typename Graph2>
926 bool isomorphism(const Graph1& g1, const Graph2& g2)
938 template<typename Graph1, typename Graph2, typename IsoMap>
939 inline bool verify_isomorphism(const Graph1& g1, const Graph2& g2, IsoMap iso_map)
950     for (typename graph_traits<Graph2>::edge_iterator e2 = edges(g2).first;