1.1 --- a/lemon/concepts/graph.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/concepts/graph.h	Sat Mar 06 14:35:12 2010 +0000
     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      /// undirected graphs should compile with this class, but it will not
    1.14      /// run properly, of course.
    1.15      /// An actual graph implementation like \ref ListGraph or
    1.16 -    /// \ref SmartGraph may have additional functionality.    
    1.17 +    /// \ref SmartGraph may have additional functionality.
    1.18      ///
    1.19      /// The undirected graphs also fulfill the concept of \ref Digraph
    1.20      /// "directed graphs", since each edge can also be regarded as two
    1.21 @@ -85,7 +85,7 @@
    1.22        /// \brief Undirected graphs should be tagged with \c UndirectedTag.
    1.23        ///
    1.24        /// Undirected graphs should be tagged with \c UndirectedTag.
    1.25 -      /// 
    1.26 +      ///
    1.27        /// This tag helps the \c enable_if technics to make compile time
    1.28        /// specializations for undirected graphs.
    1.29        typedef True UndirectedTag;
    1.30 @@ -360,7 +360,7 @@
    1.31          bool operator<(Arc) const { return false; }
    1.32  
    1.33          /// Converison to \c Edge
    1.34 -        
    1.35 +
    1.36          /// Converison to \c Edge.
    1.37          ///
    1.38          operator Edge() const { return Edge(); }