# HG changeset patch
# User deba
# Date 1129287681 0
# Node ID f214631ea1ac82d1c381202fc092d332473ec04a
# Parent  22752dd6c69324fcbe937eba8d9278ceac1081ee
Doc bugfix

diff -r 22752dd6c693 -r f214631ea1ac lemon/full_graph.h
--- a/lemon/full_graph.h	Fri Oct 14 11:00:40 2005 +0000
+++ b/lemon/full_graph.h	Fri Oct 14 11:01:21 2005 +0000
@@ -392,13 +392,13 @@
   ///
   /// \brief An undirected full graph class.
   ///
-  /// This is a simple and fast directed full graph implementation.
+  /// This is a simple and fast undirected full graph implementation.
   /// It is completely static, so you can neither add nor delete either
   /// edges or nodes.
   ///
   /// The main difference beetween the \e FullGraph and \e UndirFullGraph class
   /// is that this class conforms to the undirected graph concept and
-  /// it does not contain the hook edges.
+  /// it does not contain the loop edges.
   ///
   /// \sa FullGraph
   ///