1.1 --- a/lemon/concept/bpugraph.h	Tue Jul 04 19:06:47 2006 +0000
     1.2 +++ b/lemon/concept/bpugraph.h	Wed Jul 05 16:59:45 2006 +0000
     1.3 @@ -118,8 +118,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 @@ -414,8 +412,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 @@ -551,8 +547,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        }; 

     2.1 --- a/lemon/concept/graph.h	Tue Jul 04 19:06:47 2006 +0000
     2.2 +++ b/lemon/concept/graph.h	Wed Jul 05 16:59:45 2006 +0000
     2.3 @@ -123,8 +123,6 @@
     2.4  	/// \note This operator only have to define some strict ordering of
     2.5  	/// the items; this order has nothing to do with the iteration
     2.6  	/// ordering of the items.
     2.7 -	///
     2.8 -	/// \bug This is a technical requirement. Do we really need this?
     2.9  	bool operator<(Node) const { return false; }
    2.10  
    2.11        };
    2.12 @@ -215,8 +213,6 @@
    2.13  	/// \note This operator only have to define some strict ordering of
    2.14  	/// the items; this order has nothing to do with the iteration
    2.15  	/// ordering of the items.
    2.16 -	///
    2.17 -	/// \bug This is a technical requirement. Do we really need this?
    2.18  	bool operator<(Edge) const { return false; }
    2.19        };
    2.20      

     3.1 --- a/lemon/concept/ugraph.h	Tue Jul 04 19:06:47 2006 +0000
     3.2 +++ b/lemon/concept/ugraph.h	Wed Jul 05 16:59:45 2006 +0000
     3.3 @@ -107,8 +107,6 @@
     3.4  	/// \note This operator only have to define some strict ordering of
     3.5  	/// the items; this order has nothing to do with the iteration
     3.6  	/// ordering of the items.
     3.7 -	///
     3.8 -	/// \bug This is a technical requirement. Do we really need this?
     3.9  	bool operator<(Node) const { return false; }
    3.10  
    3.11        };
    3.12 @@ -199,8 +197,6 @@
    3.13  	/// \note This operator only have to define some strict ordering of
    3.14  	/// the items; this order has nothing to do with the iteration
    3.15  	/// ordering of the items.
    3.16 -	///
    3.17 -	/// \bug This is a technical requirement. Do we really need this?
    3.18  	bool operator<(UEdge) const { return false; }
    3.19        };
    3.20  
    3.21 @@ -337,8 +333,6 @@
    3.22  	/// \note This operator only have to define some strict ordering of
    3.23  	/// the items; this order has nothing to do with the iteration
    3.24  	/// ordering of the items.
    3.25 -	///
    3.26 -	/// \bug This is a technical requirement. Do we really need this?
    3.27  	bool operator<(Edge) const { return false; }
    3.28  	
    3.29        };