1.1 --- a/lemon/full_graph.h	Wed Oct 18 15:18:27 2006 +0000
     1.2 +++ b/lemon/full_graph.h	Fri Oct 20 12:05:54 2006 +0000
     1.3 @@ -167,7 +167,10 @@
     1.4    /// It is completely static, so you can neither add nor delete either
     1.5    /// edges or nodes.
     1.6    /// Thus it conforms to
     1.7 -  /// the \ref concept::Graph "Graph" concept
     1.8 +  /// the \ref concept::Graph "Graph" concept and
     1.9 +  ///it also has an
    1.10 +  ///important extra feature that
    1.11 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    1.12    /// \sa concept::Graph.
    1.13    ///
    1.14    /// \sa FullUGraph
    1.15 @@ -379,6 +382,10 @@
    1.16    /// is that this class conforms to the undirected graph concept and
    1.17    /// it does not contain the loop edges.
    1.18    ///
    1.19 +  ///It also has an
    1.20 +  ///important extra feature that
    1.21 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    1.22 +  ///
    1.23    /// \sa FullGraph
    1.24    ///
    1.25    /// \author Balazs Dezso

     2.1 --- a/lemon/grid_ugraph.h	Wed Oct 18 15:18:27 2006 +0000
     2.2 +++ b/lemon/grid_ugraph.h	Fri Oct 20 12:05:54 2006 +0000
     2.3 @@ -293,7 +293,10 @@
     2.4    ///\endcode
     2.5    ///
     2.6    /// The graph type is fully conform to the \ref concept::UGraph
     2.7 -  /// "Undirected Graph" concept.
     2.8 +  /// "Undirected Graph" concept,  and it also has an
     2.9 +  ///important extra feature that
    2.10 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    2.11 +  ///
    2.12    ///
    2.13    /// \author Balazs Dezso
    2.14    class GridUGraph : public ExtendedGridUGraphBase {

     3.1 --- a/lemon/list_graph.h	Wed Oct 18 15:18:27 2006 +0000
     3.2 +++ b/lemon/list_graph.h	Fri Oct 20 12:05:54 2006 +0000
     3.3 @@ -322,6 +322,10 @@
     3.4    ///also provides several additional useful extra functionalities.
     3.5    ///The most of the member functions and nested classes are
     3.6    ///documented only in the concept class.
     3.7 +  ///
     3.8 +  ///An important extra feature of this graph implementation is that
     3.9 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    3.10 +  ///
    3.11    ///\sa concept::Graph.
    3.12  
    3.13    class ListGraph : public ExtendedListGraphBase {
    3.14 @@ -743,6 +747,9 @@
    3.15  
    3.16    ///This is a simple and fast undirected graph implementation.
    3.17    ///
    3.18 +  ///An important extra feature of this graph implementation is that
    3.19 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    3.20 +  ///
    3.21    ///It conforms to the
    3.22    ///\ref concept::UGraph "UGraph concept".
    3.23    ///
    3.24 @@ -1491,6 +1498,10 @@
    3.25    ///
    3.26    /// This is a bipartite undirected graph implementation.
    3.27    /// It is conforms to the \ref concept::BpUGraph "BpUGraph concept".
    3.28 +  ///
    3.29 +  ///An important extra feature of this graph implementation is that
    3.30 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    3.31 +  ///
    3.32    /// \sa concept::BpUGraph.
    3.33    ///
    3.34    class ListBpUGraph : public ExtendedListBpUGraphBase {

     4.1 --- a/lemon/smart_graph.h	Wed Oct 18 15:18:27 2006 +0000
     4.2 +++ b/lemon/smart_graph.h	Fri Oct 20 12:05:54 2006 +0000
     4.3 @@ -194,7 +194,10 @@
     4.4    ///that <b> it does support only limited (only stack-like)
     4.5    ///node and edge deletions</b>.
     4.6    ///It conforms to 
     4.7 -  ///the \ref concept::Graph "Graph concept".
     4.8 +  ///the \ref concept::Graph "Graph concept" with an
     4.9 +  ///important extra feature that
    4.10 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    4.11 +  ///
    4.12    ///\sa concept::Graph.
    4.13    ///
    4.14    ///\author Alpar Juttner
    4.15 @@ -378,6 +381,11 @@
    4.16    /// node and edge deletions</b>.
    4.17    /// Except from this it conforms to 
    4.18    /// the \ref concept::UGraph "UGraph concept".
    4.19 +  ///
    4.20 +  ///It also has an
    4.21 +  ///important extra feature that
    4.22 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    4.23 +  ///
    4.24    /// \sa concept::UGraph.
    4.25    ///
    4.26    /// \todo Snapshot hasn't been implemented yet.
    4.27 @@ -755,6 +763,11 @@
    4.28    /// that <b> it does not support node and edge deletions</b>.
    4.29    /// Except from this it conforms to 
    4.30    /// the \ref concept::BpUGraph "BpUGraph concept".
    4.31 +  ///
    4.32 +  ///It also has an
    4.33 +  ///important extra feature that
    4.34 +  ///its maps are real \ref concept::ReferenceMap "reference map"s.
    4.35 +  ///
    4.36    /// \sa concept::BpUGraph.
    4.37    ///
    4.38    class SmartBpUGraph : public ExtendedSmartBpUGraphBase {