# HG changeset patch
# User alpar
# Date 1152118785 0
# Node ID a907fb95f1e00e4d6c69be8052c5a7a8eec93985
# Parent  4cf25c61ea65d533da31e8fd236744ab98e5fbbe
As we agreed, Node/Edge::operator<() is required by the concept

diff -r 4cf25c61ea65 -r a907fb95f1e0 lemon/concept/bpugraph.h
--- a/lemon/concept/bpugraph.h	Tue Jul 04 19:06:47 2006 +0000
+++ b/lemon/concept/bpugraph.h	Wed Jul 05 16:59:45 2006 +0000
@@ -118,8 +118,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -414,8 +412,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(UEdge) const { return false; }
       };
 
@@ -551,8 +547,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
 	
       }; 
diff -r 4cf25c61ea65 -r a907fb95f1e0 lemon/concept/graph.h
--- a/lemon/concept/graph.h	Tue Jul 04 19:06:47 2006 +0000
+++ b/lemon/concept/graph.h	Wed Jul 05 16:59:45 2006 +0000
@@ -123,8 +123,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -215,8 +213,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
       };
     
diff -r 4cf25c61ea65 -r a907fb95f1e0 lemon/concept/ugraph.h
--- a/lemon/concept/ugraph.h	Tue Jul 04 19:06:47 2006 +0000
+++ b/lemon/concept/ugraph.h	Wed Jul 05 16:59:45 2006 +0000
@@ -107,8 +107,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Node) const { return false; }
 
       };
@@ -199,8 +197,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(UEdge) const { return false; }
       };
 
@@ -337,8 +333,6 @@
 	/// \note This operator only have to define some strict ordering of
 	/// the items; this order has nothing to do with the iteration
 	/// ordering of the items.
-	///
-	/// \bug This is a technical requirement. Do we really need this?
 	bool operator<(Edge) const { return false; }
 	
       };