COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
08/23/04 13:26:09 (20 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1032
Message:

.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/leda/bipartite_matching_leda_gen.cc

    r768 r769  
    1515//#include <dimacs.h>
    1616#include <hugo/time_measure.h>
    17 #include <hugo/for_each_macros.h>
     17#include <for_each_macros.h>
    1818#include <hugo/graph_wrapper.h>
    1919#include <bipartite_graph_wrapper.h>
    2020#include <hugo/maps.h>
    21 #include <max_flow.h>
     21#include <hugo/max_flow.h>
     22#include <augmenting_flow.h>
    2223
    2324/**
     
    126127  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
    127128  typedef SageGraph MutableGraph;
    128   while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
     129  AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
     130    max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
     131  while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
    129132  std::cout << "HUGO max matching algorithm based on blocking flow augmentation."
    130133            << std::endl << "Matching size: "
    131             << max_flow_test.flowValue() << std::endl;
     134            << max_flow_test_1.flowValue() << std::endl;
    132135  std::cout << "elapsed time: " << ts << std::endl;
    133136
Note: See TracChangeset for help on using the changeset viewer.