1.1 --- a/src/work/marci/bipartite_matching_leda.cc	Mon Apr 26 11:11:55 2004 +0000
     1.2 +++ b/src/work/marci/bipartite_matching_leda.cc	Mon Apr 26 14:19:19 2004 +0000
     1.3 @@ -14,7 +14,7 @@
     1.4  //#include <dimacs.h>
     1.5  #include <time_measure.h>
     1.6  #include <for_each_macros.h>
     1.7 -#include <bfs_iterator.h>
     1.8 +//#include <bfs_iterator.h>
     1.9  #include <graph_wrapper.h>
    1.10  #include <maps.h>
    1.11  #include <edmonds_karp.h>
    1.12 @@ -47,7 +47,7 @@
    1.13  int main() {
    1.14    //for leda graph
    1.15    leda::graph lg;
    1.16 -  lg.make_undirected();
    1.17 +  //lg.make_undirected();
    1.18    typedef LedaGraphWrapper<leda::graph> Graph;
    1.19    Graph g(lg);
    1.20  
    1.21 @@ -203,12 +203,12 @@
    1.22  //   std::cout << "\n";
    1.23  
    1.24    ts.reset();  
    1.25 -  MAX_CARD_BIPARTITE_MATCHING(lg);
    1.26 +  leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);
    1.27    //  stGW::EdgeMap<int> pre_flow(stgw);
    1.28    //Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
    1.29    //  pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
    1.30    //pre_flow_test.run();
    1.31 -  //std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
    1.32 +  std::cout << "leda matching value: " << ml.size() << std::endl;
    1.33    std::cout << "elapsed time: " << ts << std::endl;
    1.34  //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 
    1.35  //     std::cout << e << ": " << pre_flow[e] << "\n";