diff -r a245eff568a6 -r f67737f5727a lemon/concept/graph.h
--- a/lemon/concept/graph.h	Tue Aug 16 16:42:04 2005 +0000
+++ b/lemon/concept/graph.h	Tue Aug 16 16:44:57 2005 +0000
@@ -427,53 +427,53 @@
       ///
       Node source(Edge) const { return INVALID; }
 
-      /// Gives back the first Node in the iterating order.
+//       /// Gives back the first Node in the iterating order.
       
-      /// Gives back the first Node in the iterating order.
-      ///     
+//       /// Gives back the first Node in the iterating order.
+//       ///     
       void first(Node&) const {}
 
-      /// Gives back the next Node in the iterating order.
+//       /// Gives back the next Node in the iterating order.
       
-      /// Gives back the next Node in the iterating order.
-      ///     
+//       /// Gives back the next Node in the iterating order.
+//       ///     
       void next(Node&) const {}
 
-      /// Gives back the first Edge in the iterating order.
+//       /// Gives back the first Edge in the iterating order.
       
-      /// Gives back the first Edge in the iterating order.
-      ///     
+//       /// Gives back the first Edge in the iterating order.
+//       ///     
       void first(Edge&) const {}
-      /// Gives back the next Edge in the iterating order.
+//       /// Gives back the next Edge in the iterating order.
       
-      /// Gives back the next Edge in the iterating order.
-      ///     
+//       /// Gives back the next Edge in the iterating order.
+//       ///     
       void next(Edge&) const {}
 
 
-      /// Gives back the first of the Edges point to the given Node.
+//       /// Gives back the first of the Edges point to the given Node.
       
-      /// Gives back the first of the Edges point to the given Node.
-      ///     
+//       /// Gives back the first of the Edges point to the given Node.
+//       ///     
       void firstIn(Edge&, const Node&) const {}
 
-      /// Gives back the next of the Edges points to the given Node.
+//       /// Gives back the next of the Edges points to the given Node.
 
 
-      /// Gives back the next of the Edges points to the given Node.
-      ///
+//       /// Gives back the next of the Edges points to the given Node.
+//       ///
       void nextIn(Edge&) const {}
 
-      /// Gives back the first of the Edges start from the given Node.
+//       /// Gives back the first of the Edges start from the given Node.
       
-      /// Gives back the first of the Edges start from the given Node.
-      ///     
+//       /// Gives back the first of the Edges start from the given Node.
+//       ///     
       void firstOut(Edge&, const Node&) const {}
 
-      /// Gives back the next of the Edges start from the given Node.
+//       /// Gives back the next of the Edges start from the given Node.
       
-      /// Gives back the next of the Edges start from the given Node.
-      ///     
+//       /// Gives back the next of the Edges start from the given Node.
+//       ///     
       void nextOut(Edge&) const {}
 
       /// \brief The base node of the iterator.
@@ -511,6 +511,7 @@
       /// \sa Reference
       /// \warning Making maps that can handle bool type (NodeMap<bool>)
       /// needs some extra attention!
+      /// \todo Wrong documentation
       template<class T> 
       class NodeMap : public ReadWriteMap< Node, T >
       {
@@ -534,6 +535,7 @@
       /// \sa Reference
       /// \warning Making maps that can handle bool type (EdgeMap<bool>)
       /// needs some extra attention!
+      /// \todo Wrong documentation
       template<class T> 
       class EdgeMap : public ReadWriteMap<Edge,T>
       {