1.1 --- a/lemon/maps.h	Thu Oct 09 13:40:40 2008 +0100
     1.2 +++ b/lemon/maps.h	Thu Oct 09 13:54:50 2008 +0100
     1.3 @@ -43,7 +43,7 @@
     1.4    template<typename K, typename V>
     1.5    class MapBase {
     1.6    public:
     1.7 -    /// \biref The key type of the map.
     1.8 +    /// \brief The key type of the map.
     1.9      typedef K Key;
    1.10      /// \brief The value type of the map.
    1.11      /// (The type of objects associated with the keys).
    1.12 @@ -1683,6 +1683,11 @@
    1.13  
    1.14    }
    1.15  
    1.16 +  /// @}
    1.17 +
    1.18 +  /// \addtogroup maps
    1.19 +  /// @{
    1.20 +
    1.21    /// \brief Writable bool map for logging each \c true assigned element
    1.22    ///
    1.23    /// A \ref concepts::WriteMap "writable" bool map for logging
    1.24 @@ -1775,6 +1780,11 @@
    1.25      return LoggerBoolMap<Iterator>(it);
    1.26    }
    1.27  
    1.28 +  /// @}
    1.29 +
    1.30 +  /// \addtogroup graph_maps
    1.31 +  /// @{
    1.32 +
    1.33    /// Provides an immutable and unique id for each item in the graph.
    1.34  
    1.35    /// The IdMap class provides a unique and immutable id for each item of the
    1.36 @@ -1882,8 +1892,6 @@
    1.37      /// The value type of the InvertableMap.
    1.38      typedef typename Map::Value Value;
    1.39  
    1.40 -
    1.41 -
    1.42      /// \brief Constructor.
    1.43      ///
    1.44      /// Construct a new InvertableMap for the graph.
    1.45 @@ -2049,8 +2057,6 @@
    1.46        return InverseMap(*this);
    1.47      }
    1.48  
    1.49 -
    1.50 -
    1.51    };
    1.52  
    1.53    /// \brief Provides a mutable, continuous and unique descriptor for each
    1.54 @@ -2266,7 +2272,7 @@
    1.55      /// \brief Constructor
    1.56      ///
    1.57      /// Constructor
    1.58 -    /// \param _digraph The digraph that the map belongs to.
    1.59 +    /// \param digraph The digraph that the map belongs to.
    1.60      explicit SourceMap(const Digraph& digraph) : _digraph(digraph) {}
    1.61  
    1.62      /// \brief The subscript operator.
    1.63 @@ -2305,7 +2311,7 @@
    1.64      /// \brief Constructor
    1.65      ///
    1.66      /// Constructor
    1.67 -    /// \param _digraph The digraph that the map belongs to.
    1.68 +    /// \param digraph The digraph that the map belongs to.
    1.69      explicit TargetMap(const Digraph& digraph) : _digraph(digraph) {}
    1.70  
    1.71      /// \brief The subscript operator.
    1.72 @@ -2344,7 +2350,7 @@
    1.73      /// \brief Constructor
    1.74      ///
    1.75      /// Constructor
    1.76 -    /// \param _graph The graph that the map belongs to.
    1.77 +    /// \param graph The graph that the map belongs to.
    1.78      explicit ForwardMap(const Graph& graph) : _graph(graph) {}
    1.79  
    1.80      /// \brief The subscript operator.
    1.81 @@ -2383,7 +2389,7 @@
    1.82      /// \brief Constructor
    1.83      ///
    1.84      /// Constructor
    1.85 -    /// \param _graph The graph that the map belongs to.
    1.86 +    /// \param graph The graph that the map belongs to.
    1.87      explicit BackwardMap(const Graph& graph) : _graph(graph) {}
    1.88  
    1.89      /// \brief The subscript operator.