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

     2.1 --- a/lemon/grid_graph.h	Tue Apr 14 10:35:38 2009 +0200
     2.2 +++ b/lemon/grid_graph.h	Tue Apr 14 10:54:42 2009 +0200
     2.3 @@ -497,9 +497,7 @@
     2.4    ///\endcode
     2.5    ///
     2.6    /// This graph type fully conforms to the \ref concepts::Graph
     2.7 -  /// "Graph" concept, and it also has an important extra feature
     2.8 -  /// that its maps are real \ref concepts::ReferenceMap
     2.9 -  /// "reference map"s.
    2.10 +  /// "Graph concept".
    2.11    class GridGraph : public ExtendedGridGraphBase {
    2.12    public:
    2.13  

     3.1 --- a/lemon/hypercube_graph.h	Tue Apr 14 10:35:38 2009 +0200
     3.2 +++ b/lemon/hypercube_graph.h	Tue Apr 14 10:54:42 2009 +0200
     3.3 @@ -292,9 +292,7 @@
     3.4    /// (assuming that the size of \c int is 32 bit).
     3.5    ///
     3.6    /// This graph type fully conforms to the \ref concepts::Graph
     3.7 -  /// "Graph" concept, and it also has an important extra feature
     3.8 -  /// that its maps are real \ref concepts::ReferenceMap
     3.9 -  /// "reference map"s.
    3.10 +  /// "Graph concept".
    3.11    class HypercubeGraph : public ExtendedHypercubeGraphBase {
    3.12    public:
    3.13  

     4.1 --- a/lemon/list_graph.h	Tue Apr 14 10:35:38 2009 +0200
     4.2 +++ b/lemon/list_graph.h	Tue Apr 14 10:54:42 2009 +0200
     4.3 @@ -320,9 +320,6 @@
     4.4    ///Most of the member functions and nested classes are documented
     4.5    ///only in the concept class.
     4.6    ///
     4.7 -  ///An important extra feature of this digraph implementation is that
     4.8 -  ///its maps are real \ref concepts::ReferenceMap "reference map"s.
     4.9 -  ///
    4.10    ///\sa concepts::Digraph
    4.11  
    4.12    class ListDigraph : public ExtendedListDigraphBase {
    4.13 @@ -1176,9 +1173,6 @@
    4.14    ///Most of the member functions and nested classes are documented
    4.15    ///only in the concept class.
    4.16    ///
    4.17 -  ///An important extra feature of this graph implementation is that
    4.18 -  ///its maps are real \ref concepts::ReferenceMap "reference map"s.
    4.19 -  ///
    4.20    ///\sa concepts::Graph
    4.21  
    4.22    class ListGraph : public ExtendedListGraphBase {

     5.1 --- a/lemon/smart_graph.h	Tue Apr 14 10:35:38 2009 +0200
     5.2 +++ b/lemon/smart_graph.h	Tue Apr 14 10:54:42 2009 +0200
     5.3 @@ -191,9 +191,7 @@
     5.4    ///It is also quite memory efficient, but at the price
     5.5    ///that <b> it does support only limited (only stack-like)
     5.6    ///node and arc deletions</b>.
     5.7 -  ///It conforms to the \ref concepts::Digraph "Digraph concept" with
     5.8 -  ///an important extra feature that its maps are real \ref
     5.9 -  ///concepts::ReferenceMap "reference map"s.
    5.10 +  ///It fully conforms to the \ref concepts::Digraph "Digraph concept".
    5.11    ///
    5.12    ///\sa concepts::Digraph.
    5.13    class SmartDigraph : public ExtendedSmartDigraphBase {
    5.14 @@ -629,15 +627,9 @@
    5.15    /// It is also quite memory efficient, but at the price
    5.16    /// that <b> it does support only limited (only stack-like)
    5.17    /// node and arc deletions</b>.
    5.18 -  /// Except from this it conforms to
    5.19 -  /// the \ref concepts::Graph "Graph concept".
    5.20 -  ///
    5.21 -  /// It also has an
    5.22 -  /// important extra feature that
    5.23 -  /// its maps are real \ref concepts::ReferenceMap "reference map"s.
    5.24 +  /// It fully conforms to the \ref concepts::Graph "Graph concept".
    5.25    ///
    5.26    /// \sa concepts::Graph.
    5.27 -  ///
    5.28    class SmartGraph : public ExtendedSmartGraphBase {
    5.29    private:
    5.30