1.1 --- a/doc/groups.dox	Fri May 15 10:16:48 2015 +0200
     1.2 +++ b/doc/groups.dox	Sun May 24 17:29:26 2015 +0200
     1.3 @@ -585,7 +585,7 @@
     1.4  In addition, the graph nodes may be \e labeled, i.e. we are given two
     1.5  node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow
     1.6  L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in
     1.7 -G\f$.
     1.8 +G_1\f$.
     1.9  
    1.10  */
    1.11  

     2.1 --- a/lemon/vf2.h	Fri May 15 10:16:48 2015 +0200
     2.2 +++ b/lemon/vf2.h	Sun May 24 17:29:26 2015 +0200
     2.3 @@ -428,7 +428,7 @@
     2.4      ///\sa See \ref Vf2MappingType for the possible values.
     2.5      void mappingType(Vf2MappingType m_type) { _mapping_type = m_type; }
     2.6  
     2.7 -    ///Find a mapping
     2.8 +    ///Finds a mapping
     2.9  
    2.10      ///It finds a mapping between from g1 into g2 according to the mapping
    2.11      ///type set by \ref mappingType(Vf2MappingType) "mappingType()".