Lines Matching refs:Graph2

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;
760 typename graph_traits<Graph2>::in_edge_iterator ei, ei_end;
850 typename graph_traits<Graph2>::out_edge_iterator ei, ei_end;
921 typename graph_traits<Graph2>::vertex_iterator vi, vi_end;
975 typename graph_traits<Graph2>::vertex_iterator vi, vi_end;
1064     template <typename Graph1, typename Graph2,
1067     bool isomorphism_impl(const Graph1& g1, const Graph2& g2,
1088       degree_vertex_invariant<InDegreeMap2, Graph2>
1100   template <typename Graph1, typename Graph2, class P, class T, class R>
1102                    const Graph2& g2,
1105     typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
1125   template <typename Graph1, typename Graph2>
1126   bool isomorphism(const Graph1& g1, const Graph2& g2)
1129     typedef typename graph_traits<Graph2>::vertex_descriptor vertex2_t;
1143     typedef typename property_map<Graph2,vertex_index_t>::const_type IndexMap2;
1148     degree_vertex_invariant<InDegreeMap2, Graph2>
1161   template<typename Graph1, typename Graph2, typename IsoMap>
1162   inline bool verify_isomorphism(const Graph1& g1, const Graph2& g2,
1171       for (typename graph_traits<Graph2>::edge_iterator e2 = edges(g2).first;