lemon/concept/ugraph.h
changeset 2120 a907fb95f1e0
parent 2111 ea1fa1bc3f6d
child 2121 09a07a851506
equal deleted inserted replaced
8:88a164673a59 9:fd2df36922a5
   105 	/// similar associative container we require this.
   105 	/// similar associative container we require this.
   106 	///
   106 	///
   107 	/// \note This operator only have to define some strict ordering of
   107 	/// \note This operator only have to define some strict ordering of
   108 	/// the items; this order has nothing to do with the iteration
   108 	/// the items; this order has nothing to do with the iteration
   109 	/// ordering of the items.
   109 	/// ordering of the items.
   110 	///
       
   111 	/// \bug This is a technical requirement. Do we really need this?
       
   112 	bool operator<(Node) const { return false; }
   110 	bool operator<(Node) const { return false; }
   113 
   111 
   114       };
   112       };
   115     
   113     
   116       /// This iterator goes through each node.
   114       /// This iterator goes through each node.
   197 	/// similar associative container we require this.
   195 	/// similar associative container we require this.
   198 	///
   196 	///
   199 	/// \note This operator only have to define some strict ordering of
   197 	/// \note This operator only have to define some strict ordering of
   200 	/// the items; this order has nothing to do with the iteration
   198 	/// the items; this order has nothing to do with the iteration
   201 	/// ordering of the items.
   199 	/// ordering of the items.
   202 	///
       
   203 	/// \bug This is a technical requirement. Do we really need this?
       
   204 	bool operator<(UEdge) const { return false; }
   200 	bool operator<(UEdge) const { return false; }
   205       };
   201       };
   206 
   202 
   207       /// This iterator goes through each undirected edge.
   203       /// This iterator goes through each undirected edge.
   208 
   204 
   335 	/// similar associative container we require this.
   331 	/// similar associative container we require this.
   336 	///
   332 	///
   337 	/// \note This operator only have to define some strict ordering of
   333 	/// \note This operator only have to define some strict ordering of
   338 	/// the items; this order has nothing to do with the iteration
   334 	/// the items; this order has nothing to do with the iteration
   339 	/// ordering of the items.
   335 	/// ordering of the items.
   340 	///
       
   341 	/// \bug This is a technical requirement. Do we really need this?
       
   342 	bool operator<(Edge) const { return false; }
   336 	bool operator<(Edge) const { return false; }
   343 	
   337 	
   344       }; 
   338       }; 
   345       /// This iterator goes through each directed edge.
   339       /// This iterator goes through each directed edge.
   346 
   340