92 ///There is also a \ref vf2() "function-type interface" called \ref vf2() |
92 ///There is also a \ref vf2() "function-type interface" called \ref vf2() |
93 ///for the %VF2 algorithm, which is probably more convenient in most |
93 ///for the %VF2 algorithm, which is probably more convenient in most |
94 ///use cases. |
94 ///use cases. |
95 /// |
95 /// |
96 ///\tparam G1 The type of the graph to be embedded. |
96 ///\tparam G1 The type of the graph to be embedded. |
97 ///The default type is \ref ListDigraph. |
97 ///The default type is \ref ListGraph. |
98 ///\tparam G2 The type of the graph g1 will be embedded into. |
98 ///\tparam G2 The type of the graph g1 will be embedded into. |
99 ///The default type is \ref ListDigraph. |
99 ///The default type is \ref ListGraph. |
100 ///\tparam M The type of the NodeMap storing the mapping. |
100 ///\tparam M The type of the NodeMap storing the mapping. |
101 ///By default, it is G1::NodeMap<G2::Node> |
101 ///By default, it is G1::NodeMap<G2::Node> |
102 ///\tparam NEQ A bool-valued binary functor determinining whether a node is |
102 ///\tparam NEQ A bool-valued binary functor determinining whether a node is |
103 ///mappable to another. By default, it is an always-true operator. |
103 ///mappable to another. By default, it is an always-true operator. |
104 /// |
104 /// |
105 ///\sa vf2() |
105 ///\sa vf2() |
106 #ifdef DOXYGEN |
106 #ifdef DOXYGEN |
107 template<class G1, class G2, class M, class NEQ > |
107 template<class G1, class G2, class M, class NEQ > |
108 #else |
108 #else |
109 template<class G1=ListDigraph, |
109 template<class G1 = ListGraph, |
110 class G2=ListDigraph, |
110 class G2 = ListGraph, |
111 class M = typename G1::template NodeMap<G2::Node>, |
111 class M = typename G1::template NodeMap<G2::Node>, |
112 class NEQ = bits::vf2::AlwaysEq > |
112 class NEQ = bits::vf2::AlwaysEq > |
113 #endif |
113 #endif |
114 class Vf2 { |
114 class Vf2 { |
115 //The graph to be embedded |
115 //The graph to be embedded |