1.1 --- a/lemon/maps.h	Fri Aug 05 09:33:42 2011 +0200
     1.2 +++ b/lemon/maps.h	Mon Aug 08 12:36:16 2011 +0200
     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-2011
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -1818,7 +1818,7 @@
    1.13    /// \brief Provides an immutable and unique id for each item in a graph.
    1.14    ///
    1.15    /// IdMap provides a unique and immutable id for each item of the
    1.16 -  /// same type (\c Node, \c Arc or \c Edge) in a graph. This id is 
    1.17 +  /// same type (\c Node, \c Arc or \c Edge) in a graph. This id is
    1.18    ///  - \b unique: different items get different ids,
    1.19    ///  - \b immutable: the id of an item does not change (even if you
    1.20    ///    delete other nodes).
    1.21 @@ -2273,7 +2273,7 @@
    1.22      }
    1.23  
    1.24      /// \brief Gives back the item belonging to a \e RangeId
    1.25 -    /// 
    1.26 +    ///
    1.27      /// Gives back the item belonging to a \e RangeId.
    1.28      Item operator()(int id) const {
    1.29        return _inv_map[id];
    1.30 @@ -2499,7 +2499,7 @@
    1.31    /// in constant time. On the other hand, the values are updated automatically
    1.32    /// whenever the digraph changes.
    1.33    ///
    1.34 -  /// \warning Besides \c addNode() and \c addArc(), a digraph structure 
    1.35 +  /// \warning Besides \c addNode() and \c addArc(), a digraph structure
    1.36    /// may provide alternative ways to modify the digraph.
    1.37    /// The correct behavior of InDegMap is not guarantied if these additional
    1.38    /// features are used. For example the functions
    1.39 @@ -2515,7 +2515,7 @@
    1.40        ::ItemNotifier::ObserverBase {
    1.41  
    1.42    public:
    1.43 -    
    1.44 +
    1.45      /// The graph type of InDegMap
    1.46      typedef GR Graph;
    1.47      typedef GR Digraph;
    1.48 @@ -2629,7 +2629,7 @@
    1.49    /// in constant time. On the other hand, the values are updated automatically
    1.50    /// whenever the digraph changes.
    1.51    ///
    1.52 -  /// \warning Besides \c addNode() and \c addArc(), a digraph structure 
    1.53 +  /// \warning Besides \c addNode() and \c addArc(), a digraph structure
    1.54    /// may provide alternative ways to modify the digraph.
    1.55    /// The correct behavior of OutDegMap is not guarantied if these additional
    1.56    /// features are used. For example the functions