diff -r 9ae88e7c04a7 -r e20173729589 lemon/unionfind.h
--- a/lemon/unionfind.h	Fri Nov 13 17:30:26 2009 +0100
+++ b/lemon/unionfind.h	Fri Nov 13 18:10:06 2009 +0100
@@ -43,7 +43,7 @@
   /// the find operation uses path compression.
   /// This is a very simple but efficient implementation, providing
   /// only four methods: join (union), find, insert and size.
-  /// For more features see the \ref UnionFindEnum class.
+  /// For more features, see the \ref UnionFindEnum class.
   ///
   /// It is primarily used in Kruskal algorithm for finding minimal
   /// cost spanning tree in a graph.