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