Ticket #597: 597-minor-fixes.patch

doc/groups.dox

@@ -585 +585 @@
 In addition, the graph nodes may be \e labeled, i.e. we are given two
 node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow
 L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in
-G\f$.
+G_1\f$.
 
 */
 

lemon/vf2.h

@@ -428 +428 @@
     ///\sa See \ref Vf2MappingType for the possible values.
     void mappingType(Vf2MappingType m_type) { _mapping_type = m_type; }
 
-    ///Find a mapping
+    ///Finds a mapping
 
     ///It finds a mapping between from g1 into g2 according to the mapping
     ///type set by \ref mappingType(Vf2MappingType) "mappingType()".

doc/references.bib

@@ -356 +356 @@
 }
 
 @article{cordella2004sub,
-  title =        {A (sub) graph isomorphism algorithm for matching
+  author =       {Cordella, Luigi P. and Foggia, Pasquale and Sansone,
+                  Carlo and Vento, Mario},
+  title =        {A (sub)graph isomorphism algorithm for matching
                   large graphs},
-  author =       {Cordella, Luigi P and Foggia, Pasquale and Sansone,
-                  Carlo and Vento, Mario},
-  journal =      {Pattern Analysis and Machine Intelligence, IEEE
-                  Transactions on},
-  volume =       26,
-  number =       10,
-  pages =        {1367--1372},
-  year =         2004,
-  publisher =    {IEEE}
+  journal =      {IEEE Transactions on Pattern Analysis and Machine
+                  Intelligence},
+  volume =       26,
+  number =       10,
+  pages =        {1367--1372},
+  year =         2004
 }