lemon/vf2pp.h
changeset 1191 d9f79b81ef6c
parent 1190 c89884c1737b
child 1192 b79ff94e27d9
equal deleted inserted replaced
3:1b480369cc5f 4:9be0b00e84c1
    74   ///There is also a \ref vf2pp() "function-type interface" called
    74   ///There is also a \ref vf2pp() "function-type interface" called
    75   ///\ref vf2pp() for the %VF2 Plus Plus algorithm, which is probably
    75   ///\ref vf2pp() for the %VF2 Plus Plus algorithm, which is probably
    76   ///more convenient in most use cases.
    76   ///more convenient in most use cases.
    77   ///
    77   ///
    78   ///\tparam G1 The type of the graph to be embedded.
    78   ///\tparam G1 The type of the graph to be embedded.
    79   ///The default type is \ref ListDigraph.
    79   ///The default type is \ref ListGraph.
    80   ///\tparam G2 The type of the graph g1 will be embedded into.
    80   ///\tparam G2 The type of the graph g1 will be embedded into.
    81   ///The default type is \ref ListDigraph.
    81   ///The default type is \ref ListGraph.
    82   ///\tparam M The type of the NodeMap storing the mapping.
    82   ///\tparam M The type of the NodeMap storing the mapping.
    83   ///By default, it is G1::NodeMap<G2::Node>
    83   ///By default, it is G1::NodeMap<G2::Node>
    84   ///\tparam M1 The type of the NodeMap storing the integer node labels of G1.
    84   ///\tparam M1 The type of the NodeMap storing the integer node labels of G1.
    85   ///The labels must be the numbers {0,1,2,..,K-1}, where K is the number of
    85   ///The labels must be the numbers {0,1,2,..,K-1}, where K is the number of
    86   ///different labels. By default, it is G1::NodeMap<int>.
    86   ///different labels. By default, it is G1::NodeMap<int>.
    90   ///
    90   ///
    91   ///\sa vf2pp()
    91   ///\sa vf2pp()
    92 #ifdef DOXYGEN
    92 #ifdef DOXYGEN
    93   template<class G1, class G2, class M, class M1, class M2 >
    93   template<class G1, class G2, class M, class M1, class M2 >
    94 #else
    94 #else
    95   template<class G1=ListDigraph,
    95   template<class G1 = ListGraph,
    96            class G2=ListDigraph,
    96            class G2 = ListGraph,
    97            class M = typename G1::template NodeMap<G2::Node>,
    97            class M = typename G1::template NodeMap<G2::Node>,
    98            class M1 = typename G1::template NodeMap<int>,
    98            class M1 = typename G1::template NodeMap<int>,
    99            class M2 = typename G2::template NodeMap<int> >
    99            class M2 = typename G2::template NodeMap<int> >
   100 #endif
   100 #endif
   101   class Vf2pp {
   101   class Vf2pp {