jacint@451: #include <iostream> jacint@451: jacint@451: #include <smart_graph.h> jacint@451: #include <dimacs.h> jacint@451: #include <preflow.h> jacint@451: #include <time_measure.h> jacint@451: jacint@451: using namespace hugo; jacint@451: jacint@451: int main(int, char **) { jacint@451: jacint@451: typedef SmartGraph Graph; jacint@451: jacint@451: typedef Graph::Node Node; jacint@451: typedef Graph::EdgeIt EdgeIt; jacint@451: jacint@451: Graph G; jacint@451: Node s, t; jacint@451: Graph::EdgeMap<int> cap(G); jacint@451: readDimacsMaxFlow(std::cin, G, s, t, cap); jacint@451: Timer ts; jacint@470: bool error=false; jacint@451: jacint@451: std::cout << jacint@451: "\n Testing preflow.h on a graph with " << jacint@451: G.nodeNum() << " nodes and " << G.edgeNum() << " edges..." jacint@451: << std::endl; jacint@451: jacint@451: jacint@451: Graph::EdgeMap<int> flow(G,0); jacint@451: Preflow<Graph, int> preflow_test(G, s, t, cap, flow); jacint@451: std::cout << "\nCalling run() (flow must be constant zero)..."<<std::endl; jacint@451: ts.reset(); jacint@451: preflow_test.run(); jacint@451: std::cout << "Elapsed time: " << ts << std::endl; jacint@451: jacint@451: Graph::NodeMap<bool> mincut(G); jacint@451: preflow_test.minMinCut(mincut); jacint@451: int min_min_cut_value=0; jacint@451: Graph::NodeMap<bool> cut(G); jacint@451: preflow_test.minCut(cut); jacint@451: int min_cut_value=0; jacint@451: Graph::NodeMap<bool> maxcut(G); jacint@451: preflow_test.maxMinCut(maxcut); jacint@451: int max_min_cut_value=0; jacint@451: EdgeIt e; jacint@451: for(G.first(e); G.valid(e); G.next(e)) { jacint@451: int c=cap[e]; jacint@451: if (mincut[G.tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=c; jacint@451: if (cut[G.tail(e)] && !cut[G.head(e)]) min_cut_value+=c; jacint@451: if (maxcut[G.tail(e)] && !maxcut[G.head(e)]) max_min_cut_value+=c; jacint@451: } jacint@451: jacint@451: std::cout << "\nChecking the result: " <<std::endl; jacint@451: std::cout << "Flow value: "<< preflow_test.flowValue() << std::endl; jacint@451: std::cout << "Min cut value: "<< min_cut_value << std::endl; jacint@451: std::cout << "Min min cut value: "<< min_min_cut_value << std::endl; jacint@451: std::cout << "Max min cut value: "<< max_min_cut_value << jacint@451: std::endl; jacint@451: jacint@451: if ( preflow_test.flowValue() == min_cut_value && jacint@451: min_cut_value == min_min_cut_value && jacint@451: min_min_cut_value == max_min_cut_value ) jacint@451: std::cout << "They are equal. " <<std::endl; jacint@470: else { jacint@470: std::cout << "ERROR! They are not equal! " <<std::endl; jacint@470: error=true; jacint@470: } jacint@451: jacint@451: jacint@451: jacint@451: Preflow<Graph, int> preflow_test2(G, s, t, cap, flow); jacint@451: std::cout << "\n\nCalling preflow(GEN_FLOW) with the given maximum flow..."<<std::endl; jacint@451: ts.reset(); jacint@451: preflow_test2.preflow(preflow_test2.GEN_FLOW); jacint@451: std::cout << "Elapsed time: " << ts << std::endl; jacint@451: jacint@451: Graph::NodeMap<bool> mincut2(G); jacint@451: preflow_test.minMinCut(mincut2); jacint@451: int min_min_cut2_value=0; jacint@451: Graph::NodeMap<bool> cut2(G); jacint@451: preflow_test.minCut(cut2); jacint@451: int min_cut2_value=0; jacint@451: Graph::NodeMap<bool> maxcut2(G); jacint@451: preflow_test.maxMinCut(maxcut2); jacint@451: int max_min_cut2_value=0; jacint@451: for(G.first(e); G.valid(e); G.next(e)) { jacint@451: int c=cap[e]; jacint@451: if (mincut2[G.tail(e)] && !mincut2[G.head(e)]) min_min_cut2_value+=c; jacint@451: if (cut2[G.tail(e)] && !cut2[G.head(e)]) min_cut2_value+=c; jacint@451: if (maxcut2[G.tail(e)] && !maxcut2[G.head(e)]) max_min_cut2_value+=c; jacint@451: } jacint@451: jacint@451: std::cout << "\nThe given flow value is " jacint@451: << preflow_test2.flowValue(); jacint@451: jacint@451: if ( preflow_test2.flowValue() == min_cut2_value && jacint@451: min_cut2_value == min_min_cut2_value && jacint@451: min_min_cut2_value == max_min_cut2_value ) jacint@451: std::cout <<", which is equal to all three min cut values." jacint@451: <<std::endl; jacint@470: else { jacint@470: std::cout << "ERROR! It is not equal to all three min cut values! " jacint@470: <<std::endl; jacint@470: error=true; jacint@470: } jacint@470: jacint@451: jacint@451: jacint@451: jacint@451: Graph::EdgeMap<int> flow3(G,0); jacint@451: Preflow<Graph, int> preflow_test3(G, s, t, cap, flow3); jacint@451: std::cout << "\n\nCalling preflowPhase0(PREFLOW) on the constant zero flow..."<<std::endl; jacint@451: ts.reset(); jacint@451: preflow_test3.preflowPhase0(preflow_test3.PREFLOW); jacint@451: std::cout << "Elapsed time: " << ts << std::endl; jacint@451: Graph::NodeMap<bool> actcut3(G); jacint@451: std::cout << "\nCalling actMinCut()..."<<std::endl; jacint@451: preflow_test3.actMinCut(actcut3); jacint@451: std::cout << "Calling preflowPhase1() on the given flow..."<<std::endl; jacint@451: ts.reset(); jacint@451: preflow_test3.preflowPhase1(); jacint@451: std::cout << "Elapsed time: " << ts << std::endl; jacint@451: jacint@451: int act_min_cut3_value=0; jacint@451: jacint@451: Graph::NodeMap<bool> mincut3(G); jacint@451: preflow_test.minMinCut(mincut3); jacint@451: int min_min_cut3_value=0; jacint@451: jacint@451: Graph::NodeMap<bool> cut3(G); jacint@451: preflow_test.minCut(cut3); jacint@451: int min_cut3_value=0; jacint@451: jacint@451: Graph::NodeMap<bool> maxcut3(G); jacint@451: preflow_test.maxMinCut(maxcut3); jacint@451: int max_min_cut3_value=0; jacint@451: jacint@451: for(G.first(e); G.valid(e); G.next(e)) { jacint@451: int c=cap[e]; jacint@451: if (mincut3[G.tail(e)] && !mincut3[G.head(e)]) min_min_cut3_value+=c; jacint@451: if (cut3[G.tail(e)] && !cut3[G.head(e)]) min_cut3_value+=c; jacint@451: if (maxcut3[G.tail(e)] && !maxcut3[G.head(e)]) max_min_cut3_value+=c; jacint@451: if (actcut3[G.tail(e)] && !actcut3[G.head(e)]) act_min_cut3_value+=c; jacint@451: } jacint@451: jacint@451: std::cout << "\nThe min cut value given by actMinCut() after phase 0 is "<< jacint@451: act_min_cut3_value; jacint@451: jacint@451: if ( preflow_test3.flowValue() == min_cut3_value && jacint@451: min_cut3_value == min_min_cut3_value && jacint@451: min_min_cut3_value == max_min_cut3_value && jacint@451: max_min_cut3_value == act_min_cut3_value ) { jacint@451: std::cout << jacint@451: ", which is equal to the given flow value and to all three min cut values after phase 1." jacint@451: <<std::endl; jacint@451: } jacint@470: else { jacint@470: std::cout << jacint@470: "ERROR! It is not equal to the given flow value and to all three min cut values after phase 1! " jacint@470: <<std::endl; jacint@470: error=true; jacint@470: } jacint@470: jacint@451: jacint@451: jacint@451: jacint@451: jacint@451: Graph::EdgeMap<int> flow4(G,0); jacint@451: Preflow<Graph, int> preflow_test4(G, s, t, cap, flow4); jacint@451: std::cout << jacint@451: "\n\nCalling preflow(PREFLOW) with the constant 0 flow, the result is f..." jacint@451: <<std::endl; jacint@451: preflow_test4.preflow(preflow_test4.PREFLOW); jacint@451: jacint@451: std::cout << "Swapping the source and the target, "<<std::endl; jacint@451: std::cout << "by calling resetSource(t) and resetTarget(s)..." jacint@451: <<std::endl; jacint@451: preflow_test4.resetSource(t); jacint@451: preflow_test4.resetTarget(s); jacint@451: jacint@451: std::cout << jacint@451: "Calling preflow(PREFLOW) to find a maximum t-s flow starting with flow f..." jacint@451: <<std::endl; jacint@451: preflow_test4.preflow(preflow_test4.PREFLOW); jacint@451: jacint@451: Graph::NodeMap<bool> mincut4(G); jacint@451: preflow_test4.minMinCut(mincut4); jacint@451: int min_min_cut4_value=0; jacint@451: Graph::NodeMap<bool> cut4(G); jacint@451: preflow_test4.minCut(cut4); jacint@451: int min_cut4_value=0; jacint@451: Graph::NodeMap<bool> maxcut4(G); jacint@451: preflow_test4.maxMinCut(maxcut4); jacint@451: int max_min_cut4_value=0; jacint@451: for(G.first(e); G.valid(e); G.next(e)) { jacint@451: int c=cap[e]; jacint@451: if (mincut4[G.tail(e)] && !mincut4[G.head(e)]) min_min_cut4_value+=c; jacint@451: if (cut4[G.tail(e)] && !cut4[G.head(e)]) min_cut4_value+=c; jacint@451: if (maxcut4[G.tail(e)] && !maxcut4[G.head(e)]) max_min_cut4_value+=c; jacint@451: } jacint@451: jacint@451: std::cout << "\nThe given flow value is " jacint@451: << preflow_test4.flowValue(); jacint@451: jacint@451: if ( preflow_test4.flowValue() == min_cut4_value && jacint@451: min_cut4_value == min_min_cut4_value && jacint@451: min_min_cut4_value == max_min_cut4_value ) jacint@451: std::cout <<", which is equal to all three min cut values." jacint@451: <<std::endl; jacint@470: else { jacint@470: std::cout << "ERROR! It is not equal to all three min cut values! " jacint@470: <<std::endl; jacint@470: error=true; jacint@470: } jacint@451: jacint@451: jacint@451: jacint@451: jacint@451: Graph::EdgeMap<int> flow5(G,0); jacint@451: std::cout << "Resetting the stored flow to constant zero, by calling resetFlow..." jacint@451: <<std::endl; jacint@451: preflow_test4.resetFlow(flow5); jacint@451: std::cout << jacint@451: "Calling preflow(GEN_FLOW) to find a maximum t-s flow "<<std::endl; jacint@451: std::cout << jacint@451: "starting with this constant zero flow..." <<std::endl; jacint@451: preflow_test4.preflow(preflow_test4.GEN_FLOW); jacint@451: jacint@451: Graph::NodeMap<bool> mincut5(G); jacint@451: preflow_test4.minMinCut(mincut5); jacint@451: int min_min_cut5_value=0; jacint@451: Graph::NodeMap<bool> cut5(G); jacint@451: preflow_test4.minCut(cut5); jacint@451: int min_cut5_value=0; jacint@451: Graph::NodeMap<bool> maxcut5(G); jacint@451: preflow_test4.maxMinCut(maxcut5); jacint@451: int max_min_cut5_value=0; jacint@451: for(G.first(e); G.valid(e); G.next(e)) { jacint@451: int c=cap[e]; jacint@451: if (mincut5[G.tail(e)] && !mincut5[G.head(e)]) min_min_cut5_value+=c; jacint@451: if (cut5[G.tail(e)] && !cut5[G.head(e)]) min_cut5_value+=c; jacint@451: if (maxcut5[G.tail(e)] && !maxcut5[G.head(e)]) max_min_cut5_value+=c; jacint@451: } jacint@451: jacint@451: std::cout << "\nThe given flow value is " jacint@451: << preflow_test4.flowValue(); jacint@451: jacint@451: if ( preflow_test4.flowValue() == min_cut5_value && jacint@451: min_cut5_value == min_min_cut5_value && jacint@451: min_min_cut5_value == max_min_cut5_value ) jacint@451: std::cout <<", which is equal to all three min cut values." jacint@451: <<std::endl<<std::endl; jacint@470: else { jacint@470: std::cout << "ERROR! It is not equal to all three min cut values! " jacint@470: <<std::endl; jacint@470: error=true; jacint@470: } jacint@470: jacint@470: if (error) std::cout <<"\nThere was some error in the results!\n"<<std::endl; jacint@470: else std::cout <<"\nThere was no error in the results.\n"<<std::endl; jacint@451: jacint@451: return 0; jacint@451: }