1.1 --- a/lemon/full_graph.h	Tue Apr 14 10:35:38 2009 +0200
     1.2 +++ b/lemon/full_graph.h	Tue Apr 14 10:54:42 2009 +0200
     1.3 @@ -157,9 +157,8 @@
     1.4    /// can neither add nor delete either arcs or nodes, and it needs
     1.5    /// constant space in memory.
     1.6    ///
     1.7 -  /// This class conforms to the \ref concepts::Digraph "Digraph" concept
     1.8 -  /// and it also has an important extra feature that its maps are
     1.9 -  /// real \ref concepts::ReferenceMap "reference map"s.
    1.10 +  /// This class fully conforms to the \ref concepts::Digraph
    1.11 +  /// "Digraph concept".
    1.12    ///
    1.13    /// The \c FullDigraph and \c FullGraph classes are very similar,
    1.14    /// but there are two differences. While this class conforms only
    1.15 @@ -527,9 +526,7 @@
    1.16    /// add nor delete either edges or nodes, and it needs constant
    1.17    /// space in memory.
    1.18    ///
    1.19 -  /// This class conforms to the \ref concepts::Graph "Graph" concept
    1.20 -  /// and it also has an important extra feature that its maps are
    1.21 -  /// real \ref concepts::ReferenceMap "reference map"s.
    1.22 +  /// This class fully conforms to the \ref concepts::Graph "Graph concept".
    1.23    ///
    1.24    /// The \c FullGraph and \c FullDigraph classes are very similar,
    1.25    /// but there are two differences. While the \c FullDigraph class