1.1 --- a/lemon/list_graph.h	Wed Oct 18 15:18:27 2006 +0000
     1.2 +++ b/lemon/list_graph.h	Fri Oct 20 12:05:54 2006 +0000
     1.3 @@ -322,6 +322,10 @@
     1.4    ///also provides several additional useful extra functionalities.
     1.5    ///The most of the member functions and nested classes are
     1.6    ///documented only in the concept class.
     1.7 +  ///
     1.8 +  ///An important extra feature of this graph implementation is that
     1.9 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    1.10 +  ///
    1.11    ///\sa concept::Graph.
    1.12  
    1.13    class ListGraph : public ExtendedListGraphBase {
    1.14 @@ -743,6 +747,9 @@
    1.15  
    1.16    ///This is a simple and fast undirected graph implementation.
    1.17    ///
    1.18 +  ///An important extra feature of this graph implementation is that
    1.19 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    1.20 +  ///
    1.21    ///It conforms to the
    1.22    ///\ref concept::UGraph "UGraph concept".
    1.23    ///
    1.24 @@ -1491,6 +1498,10 @@
    1.25    ///
    1.26    /// This is a bipartite undirected graph implementation.
    1.27    /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
    1.28 +  ///
    1.29 +  ///An important extra feature of this graph implementation is that
    1.30 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    1.31 +  ///
    1.32    /// \sa concept::BpUGraph.
    1.33    ///
    1.34    class ListBpUGraph : public ExtendedListBpUGraphBase {