1.1 --- a/lemon/concept/ugraph.h	Tue Jul 04 19:06:47 2006 +0000
     1.2 +++ b/lemon/concept/ugraph.h	Wed Jul 05 16:59:45 2006 +0000
     1.3 @@ -107,8 +107,6 @@
     1.4  	/// \note This operator only have to define some strict ordering of
     1.5  	/// the items; this order has nothing to do with the iteration
     1.6  	/// ordering of the items.
     1.7 -	///
     1.8 -	/// \bug This is a technical requirement. Do we really need this?
     1.9  	bool operator<(Node) const { return false; }
    1.10  
    1.11        };
    1.12 @@ -199,8 +197,6 @@
    1.13  	/// \note This operator only have to define some strict ordering of
    1.14  	/// the items; this order has nothing to do with the iteration
    1.15  	/// ordering of the items.
    1.16 -	///
    1.17 -	/// \bug This is a technical requirement. Do we really need this?
    1.18  	bool operator<(UEdge) const { return false; }
    1.19        };
    1.20  
    1.21 @@ -337,8 +333,6 @@
    1.22  	/// \note This operator only have to define some strict ordering of
    1.23  	/// the items; this order has nothing to do with the iteration
    1.24  	/// ordering of the items.
    1.25 -	///
    1.26 -	/// \bug This is a technical requirement. Do we really need this?
    1.27  	bool operator<(Edge) const { return false; }
    1.28  	
    1.29        };