COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/11/04 19:37:34 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@796
Message:

documentation of bipartite matchings, cleaning

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/bipartite_matching_try_3.cc

    r602 r613  
    132132  FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0);
    133133  FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0);
    134   MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>,
     134  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>,
    135135    Graph::EdgeMap<int>, Graph::NodeMap<int> >
    136136    matching_test(g, ge1, gn1, gef, gnf);
     
    147147  FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0);
    148148  //FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0);
    149   MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>,
     149  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>,
    150150    Graph::EdgeMap<int>, Graph::NodeMap<int> >
    151151    matching_test_1(g, ge1, gn1, gef/*, gnf*/);
Note: See TracChangeset for help on using the changeset viewer.