src/work/marci/bipartite_matching_try.cc
changeset 476 cfe550761745
parent 465 d72e56f1730d
child 480 4fb0d1e166ea
equal deleted inserted replaced
1:078714a4d136 2:0b08712b2e9d
    10 #include <time_measure.h>
    10 #include <time_measure.h>
    11 #include <for_each_macros.h>
    11 #include <for_each_macros.h>
    12 #include <bfs_iterator.h>
    12 #include <bfs_iterator.h>
    13 #include <graph_wrapper.h>
    13 #include <graph_wrapper.h>
    14 #include <maps.h>
    14 #include <maps.h>
    15 #include <edmonds_karp.h>
       
    16 #include <preflow.h>
    15 #include <preflow.h>
    17 
    16 
    18 /**
    17 /**
    19  * Inicializalja a veletlenszamgeneratort.
    18  * Inicializalja a veletlenszamgeneratort.
    20  * Figyelem, ez nem jo igazi random szamokhoz,
    19  * Figyelem, ez nem jo igazi random szamokhoz,
   178 //   }
   177 //   }
   179 //   std::cout << "\n";
   178 //   std::cout << "\n";
   180 
   179 
   181   ts.reset();
   180   ts.reset();
   182   stGW::EdgeMap<int> pre_flow(stgw);
   181   stGW::EdgeMap<int> pre_flow(stgw);
   183   Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
   182   MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
   184     pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow/*, true*/);
   183     pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow/*, true*/);
   185   pre_flow_test.run();
   184   pre_flow_test.run();
   186   std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
   185   std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
   187   std::cout << "elapsed time: " << ts << std::endl;
   186   std::cout << "elapsed time: " << ts << std::endl;
   188 //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 
   187 //   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) {