1.1 --- a/lemon/bits/vector_map.h	Mon Oct 17 10:28:48 2005 +0000
     1.2 +++ b/lemon/bits/vector_map.h	Mon Oct 17 10:30:59 2005 +0000
     1.3 @@ -71,14 +71,6 @@
     1.4      typedef _Item Key;
     1.5      /// The value type of the map.
     1.6      typedef _Value Value;
     1.7 -    /// The const reference type of the map.
     1.8 -    typedef typename Container::const_reference ConstReference;
     1.9 -    /// The reference type of the map.
    1.10 -    typedef typename Container::reference Reference;
    1.11 -
    1.12 -    typedef const Value ConstValue;
    1.13 -    typedef Value* Pointer;
    1.14 -    typedef const Value* ConstPointer;
    1.15  
    1.16      typedef AlterationNotifier<_Item> Registry;
    1.17  
    1.18 @@ -99,7 +91,6 @@
    1.19      /// The pointer type of the map;
    1.20      typedef typename Container::const_pointer ConstPointer;
    1.21  
    1.22 -    typedef True FullTypeTag;
    1.23  
    1.24      /// \brief Constructor to attach the new map into the registry.
    1.25      ///

     2.1 --- a/lemon/graph_utils.h	Mon Oct 17 10:28:48 2005 +0000
     2.2 +++ b/lemon/graph_utils.h	Mon Oct 17 10:30:59 2005 +0000
     2.3 @@ -1326,7 +1326,7 @@
     2.4    /// whenever the graph changes.
     2.5    ///
     2.6    /// \warning Besides addNode() and addEdge(), a graph structure may provide
     2.7 -  /// alternative ways to mogify the graph. The correct behavior of InDegMap
     2.8 +  /// alternative ways to modify the graph. The correct behavior of InDegMap
     2.9    /// is not guarantied if these additional featureas are used. For example
    2.10    /// the funstions \ref ListGraph::changeSource() "changeSource()",
    2.11    /// \ref ListGraph::changeTarget() "changeTarget()" and
    2.12 @@ -1432,7 +1432,7 @@
    2.13    /// whenever the graph changes.
    2.14    ///
    2.15    /// \warning Besides addNode() and addEdge(), a graph structure may provide
    2.16 -  /// alternative ways to mogify the graph. The correct behavior of OutDegMap
    2.17 +  /// alternative ways to modify the graph. The correct behavior of OutDegMap
    2.18    /// is not guarantied if these additional featureas are used. For example
    2.19    /// the funstions \ref ListGraph::changeSource() "changeSource()",
    2.20    /// \ref ListGraph::changeTarget() "changeTarget()" and

     3.1 --- a/lemon/path.h	Mon Oct 17 10:28:48 2005 +0000
     3.2 +++ b/lemon/path.h	Mon Oct 17 10:30:59 2005 +0000
     3.3 @@ -383,6 +383,7 @@
     3.4    //! and \c Edge of the original graph.
     3.5    //!
     3.6    //! \todo Thoroughfully check all the range and consistency tests.
     3.7 +  /// \todo May we need just path for undirected graph instead of this.
     3.8    template<typename Graph>
     3.9    class UndirPath {
    3.10    public: