1.1 --- a/lemon/full_graph.h	Fri Oct 14 11:00:40 2005 +0000
     1.2 +++ b/lemon/full_graph.h	Fri Oct 14 11:01:21 2005 +0000
     1.3 @@ -392,13 +392,13 @@
     1.4    ///
     1.5    /// \brief An undirected full graph class.
     1.6    ///
     1.7 -  /// This is a simple and fast directed full graph implementation.
     1.8 +  /// This is a simple and fast undirected full graph implementation.
     1.9    /// It is completely static, so you can neither add nor delete either
    1.10    /// edges or nodes.
    1.11    ///
    1.12    /// The main difference beetween the \e FullGraph and \e UndirFullGraph class
    1.13    /// is that this class conforms to the undirected graph concept and
    1.14 -  /// it does not contain the hook edges.
    1.15 +  /// it does not contain the loop edges.
    1.16    ///
    1.17    /// \sa FullGraph
    1.18    ///