Changeset 465:d72e56f1730d in lemon0.x for src/work/marci
 Timestamp:
 04/29/04 11:08:14 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@616
 Location:
 src/work/marci
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/bipartite_matching_try.cc
r410 r465 182 182 stGW::EdgeMap<int> pre_flow(stgw); 183 183 Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 184 pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow , true);184 pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow/*, true*/); 185 185 pre_flow_test.run(); 186 186 std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl; 
src/work/marci/edmonds_karp_demo.cc
r418 r465 72 72 Graph::EdgeMap<int> flow(G); //0 flow 73 73 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 74 pre_flow_test(G, s, t, cap, flow , true);74 pre_flow_test(G, s, t, cap, flow/*, true*/); 75 75 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 76 pre_flow_ize(G, s, t, cap, flow , false);77 PreflowRes<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> >78 pre_flow_res(G, s, t, cap, flow, true);76 pre_flow_ize(G, s, t, cap, flow/*, false*/); 77 // PreflowRes<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 78 // pre_flow_res(G, s, t, cap, flow/*, true*/); 79 79 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 80 80 max_flow_test(G, s, t, cap, flow); … … 92 92 FOR_EACH_LOC(Graph::EdgeIt, e, G) flow.set(e, 0); 93 93 ts.reset(); 94 pre_flow_ize. run();94 pre_flow_ize.preflow(Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> >::GEN_FLOW); 95 95 std::cout << "elapsed time: " << ts << std::endl; 96 96 std::cout << "flow value: "<< pre_flow_ize.flowValue() << std::endl; 97 97 } 98 98 99 {100 std::cout << "wrapped preflow ..." << std::endl;101 FOR_EACH_LOC(Graph::EdgeIt, e, G) flow.set(e, 0);102 ts.reset();103 pre_flow_res.run();104 std::cout << "elapsed time: " << ts << std::endl;105 std::cout << "flow value: "<< pre_flow_test.flowValue() << std::endl;106 }99 // { 100 // std::cout << "wrapped preflow ..." << std::endl; 101 // FOR_EACH_LOC(Graph::EdgeIt, e, G) flow.set(e, 0); 102 // ts.reset(); 103 // pre_flow_res.run(); 104 // std::cout << "elapsed time: " << ts << std::endl; 105 // std::cout << "flow value: "<< pre_flow_test.flowValue() << std::endl; 106 // } 107 107 108 108 { 
src/work/marci/lg_vs_sg.cc
r379 r465 36 36 Graph::EdgeMap<int> flow(G); //0 flow 37 37 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 38 pre_flow_test(G, s, t, cap, flow , true);38 pre_flow_test(G, s, t, cap, flow/*, true*/); 39 39 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 40 40 max_flow_test(G, s, t, cap, flow); … … 110 110 Graph::EdgeMap<int> flow(G); //0 flow 111 111 Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 112 pre_flow_test(G, s, t, cap, flow , true);112 pre_flow_test(G, s, t, cap, flow/*, true*/); 113 113 MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 114 114 max_flow_test(G, s, t, cap, flow);
Note: See TracChangeset
for help on using the changeset viewer.