Changeset 1622:9c98841eda96 in lemon-0.x for lemon

Timestamp:

08/11/05 15:16:39 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2130

Message:

Ordering in the graph concept.

File:

• lemon/concept/graph.h (modified) (2 diffs)

lemon/concept/graph.h

@@ -177 +177 @@
         bool operator!=(Node) const { return true; }
 
+        /// Artificial ordering operator.
+        
+        /// To allow the use of graph descriptors as key type in std::map or
+        /// similar associative container we require this.
+        ///
+        /// \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; }
+
       };
     
@@ -256 +268 @@
         ///
         bool operator!=(Edge) const { return true; }
+
+        /// Artificial ordering operator.
+        
+        /// To allow the use of graph descriptors as key type in std::map or
+        /// similar associative container we require this.
+        ///
+        /// \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; }
       };