COIN-OR::LEMON - Graph Library

Changeset 1622:9c98841eda96 in lemon-0.x


Ignore:
Timestamp:
08/11/05 15:16:39 (14 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:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/graph.h

    r1620 r1622  
    177177        bool operator!=(Node) const { return true; }
    178178
     179        /// Artificial ordering operator.
     180       
     181        /// To allow the use of graph descriptors as key type in std::map or
     182        /// similar associative container we require this.
     183        ///
     184        /// \note This operator only have to define some strict ordering of
     185        /// the items; this order has nothing to do with the iteration
     186        /// ordering of the items.
     187        ///
     188        /// \bug This is a technical requirement. Do we really need this?
     189        bool operator<(Node) const { return false; }
     190
    179191      };
    180192   
     
    256268        ///
    257269        bool operator!=(Edge) const { return true; }
     270
     271        /// Artificial ordering operator.
     272       
     273        /// To allow the use of graph descriptors as key type in std::map or
     274        /// similar associative container we require this.
     275        ///
     276        /// \note This operator only have to define some strict ordering of
     277        /// the items; this order has nothing to do with the iteration
     278        /// ordering of the items.
     279        ///
     280        /// \bug This is a technical requirement. Do we really need this?
     281        bool operator<(Edge) const { return false; }
    258282      };
    259283   
Note: See TracChangeset for help on using the changeset viewer.