COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/17/04 19:18:26 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@275
Message:

max cardinality bipartite matching demo, something to play with it

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/leda_graph_wrapper.h

    r189 r198  
    7171      bool operator==(Node n) const { return _n==n._n; } //FIXME
    7272      bool operator!=(Node n) const { return _n!=n._n; } //FIXME
     73      operator leda_node () { return _n; }
    7374    };
    7475   
     
    101102      //Edge(const Edge &) {}
    102103      bool operator==(Edge e) const { return _e==e._e; } //FIXME
    103       bool operator!=(Edge e) const { return _e!=e._e; } //FIXME   
     104      bool operator!=(Edge e) const { return _e!=e._e; } //FIXME
     105      operator leda_edge () { return _e; }
    104106    };
    105107   
Note: See TracChangeset for help on using the changeset viewer.