1.1 --- a/lemon/unionfind.h	Tue Dec 20 17:44:38 2011 +0100
     1.2 +++ b/lemon/unionfind.h	Tue Dec 20 18:15:14 2011 +0100
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -43,7 +43,7 @@
    1.13    /// the find operation uses path compression.
    1.14    /// This is a very simple but efficient implementation, providing
    1.15    /// only four methods: join (union), find, insert and size.
    1.16 -  /// For more features see the \ref UnionFindEnum class.
    1.17 +  /// For more features, see the \ref UnionFindEnum class.
    1.18    ///
    1.19    /// It is primarily used in Kruskal algorithm for finding minimal
    1.20    /// cost spanning tree in a graph.