COIN-OR::LEMON - Graph Library

Changeset 2120:a907fb95f1e0 in lemon-0.x for lemon


Ignore:
Timestamp:
07/05/06 18:59:45 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2832
Message:

As we agreed, Node/Edge::operator<() is required by the concept

Location:
lemon/concept
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/concept/bpugraph.h

    r2111 r2120  
    119119        /// the items; this order has nothing to do with the iteration
    120120        /// ordering of the items.
    121         ///
    122         /// \bug This is a technical requirement. Do we really need this?
    123121        bool operator<(Node) const { return false; }
    124122
     
    415413        /// the items; this order has nothing to do with the iteration
    416414        /// ordering of the items.
    417         ///
    418         /// \bug This is a technical requirement. Do we really need this?
    419415        bool operator<(UEdge) const { return false; }
    420416      };
     
    552548        /// the items; this order has nothing to do with the iteration
    553549        /// ordering of the items.
    554         ///
    555         /// \bug This is a technical requirement. Do we really need this?
    556550        bool operator<(Edge) const { return false; }
    557551       
  • lemon/concept/graph.h

    r2117 r2120  
    124124        /// the items; this order has nothing to do with the iteration
    125125        /// ordering of the items.
    126         ///
    127         /// \bug This is a technical requirement. Do we really need this?
    128126        bool operator<(Node) const { return false; }
    129127
     
    216214        /// the items; this order has nothing to do with the iteration
    217215        /// ordering of the items.
    218         ///
    219         /// \bug This is a technical requirement. Do we really need this?
    220216        bool operator<(Edge) const { return false; }
    221217      };
  • lemon/concept/ugraph.h

    r2111 r2120  
    108108        /// the items; this order has nothing to do with the iteration
    109109        /// ordering of the items.
    110         ///
    111         /// \bug This is a technical requirement. Do we really need this?
    112110        bool operator<(Node) const { return false; }
    113111
     
    200198        /// the items; this order has nothing to do with the iteration
    201199        /// ordering of the items.
    202         ///
    203         /// \bug This is a technical requirement. Do we really need this?
    204200        bool operator<(UEdge) const { return false; }
    205201      };
     
    338334        /// the items; this order has nothing to do with the iteration
    339335        /// ordering of the items.
    340         ///
    341         /// \bug This is a technical requirement. Do we really need this?
    342336        bool operator<(Edge) const { return false; }
    343337       
Note: See TracChangeset for help on using the changeset viewer.