marci@475: // -*- c++ -*-
marci@475: #include <iostream>
marci@475: #include <fstream>
marci@475: 
marci@642: #include <sage_graph.h>
marci@555: #include <hugo/smart_graph.h>
marci@555: #include <hugo/dimacs.h>
marci@555: #include <hugo/time_measure.h>
marci@475: //#include <graph_wrapper.h>
marci@762: #include <hugo/max_flow.h>
marci@762: #include <augmenting_flow.h>
marci@475: //#include <preflow_res.h>
marci@762: #include <for_each_macros.h>
marci@651: #include <graph_concept.h>
marci@475: 
marci@475: using namespace hugo;
marci@475: 
marci@475: // Use a DIMACS max flow file as stdin.
marci@775: // max_flow_demo < dimacs_max_flow_file
marci@475: 
marci@475: int main(int, char **) {
marci@475: 
marci@642:   typedef SageGraph MutableGraph;
marci@475: 
marci@651:   //typedef FullFeatureGraphConcept Graph;
marci@762:   //typedef SmartGraph Graph;
marci@762:   typedef SageGraph Graph;
marci@475:   typedef Graph::Node Node;
marci@475:   typedef Graph::EdgeIt EdgeIt;
marci@475: 
marci@577:   Graph g;
marci@652: 
marci@475:   Node s, t;
marci@577:   Graph::EdgeMap<int> cap(g);
marci@577:   //readDimacsMaxFlow(std::cin, g, s, t, cap);
marci@577:   readDimacs(std::cin, g, cap, s, t);
marci@475:   Timer ts;
marci@577:   Graph::EdgeMap<int> flow(g); //0 flow
marci@476:   MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@577:     max_flow_test(g, s, t, cap, flow);
marci@762:   AugmentingFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@762:     augmenting_flow_test(g, s, t, cap, flow);
marci@762:   
marci@646:   Graph::NodeMap<bool> cut(g);
marci@475: 
marci@475:   {
marci@475:     std::cout << "preflow ..." << std::endl;
marci@475:     ts.reset();
marci@476:     max_flow_test.run();
marci@475:     std::cout << "elapsed time: " << ts << std::endl;
marci@476:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@646:     max_flow_test.actMinCut(cut);
marci@646: 
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@646:       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:     }
marci@475:   }
marci@475: 
marci@475:   {
marci@475:     std::cout << "preflow ..." << std::endl;
marci@577:     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@475:     ts.reset();
marci@476:     max_flow_test.preflow(MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> >::GEN_FLOW);
marci@475:     std::cout << "elapsed time: " << ts << std::endl;
marci@476:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@646: 
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@646:       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:     }
marci@475:   }
marci@475: 
marci@475: //   {
marci@475: //     std::cout << "wrapped preflow ..." << std::endl;
marci@577: //     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@475: //     ts.reset();
marci@475: //     pre_flow_res.run();
marci@475: //     std::cout << "elapsed time: " << ts << std::endl;
marci@475: //     std::cout << "flow value: "<< pre_flow_test.flowValue() << std::endl;
marci@475: //   }
marci@475: 
marci@475:   {
marci@475:     std::cout << "physical blocking flow augmentation ..." << std::endl;
marci@577:     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@475:     ts.reset();
marci@475:     int i=0;
marci@762:     while (augmenting_flow_test.augmentOnBlockingFlow<MutableGraph>()) { ++i; }
marci@475:     std::cout << "elapsed time: " << ts << std::endl;
marci@475:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@762:     std::cout << "flow value: "<< augmenting_flow_test.flowValue() << std::endl;
marci@646: 
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@646:       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:     }
marci@475:   }
marci@475: 
marci@475: //   {
marci@775: //     std::cout << "on-the-fly blocking flow augmentation ..." << std::endl;
marci@577: //     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@475: //     ts.reset();
marci@475: //     int i=0;
marci@775: //     while (augmenting_flow_test.augmentOnBlockingFlow2()) { ++i; }
marci@475: //     std::cout << "elapsed time: " << ts << std::endl;
marci@475: //     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@775: //     std::cout << "flow value: "<< augmenting_flow_test.flowValue() << std::endl;
marci@775: 
marci@775: //     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@775: //       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@775: // 	std::cout << "Slackness does not hold!" << std::endl;
marci@775: //       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@775: // 	std::cout << "Slackness does not hold!" << std::endl;
marci@775: //     }
marci@475: //   }
marci@475: 
marci@475:   {
marci@475:     std::cout << "on-the-fly shortest path augmentation ..." << std::endl;
marci@577:     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@475:     ts.reset();
marci@475:     int i=0;
marci@762:     while (augmenting_flow_test.augmentOnShortestPath()) { ++i; }
marci@475:     std::cout << "elapsed time: " << ts << std::endl;
marci@475:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@762:     std::cout << "flow value: "<< augmenting_flow_test.flowValue() << std::endl;
marci@646: 
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@646:       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:     }
marci@475:   }
marci@475: 
marci@646:   {
marci@646:     std::cout << "on-the-fly shortest path augmentation ..." << std::endl;
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) flow.set(e, 0);
marci@646:     ts.reset();
marci@646:     int i=0;
marci@762:     while (augmenting_flow_test.augmentOnShortestPath2()) { ++i; }
marci@646:     std::cout << "elapsed time: " << ts << std::endl;
marci@646:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@762:     std::cout << "flow value: "<< augmenting_flow_test.flowValue() << std::endl;
marci@646: 
marci@646:     FOR_EACH_LOC(Graph::EdgeIt, e, g) {
marci@646:       if (cut[g.tail(e)] && !cut[g.head(e)] && !flow[e]==cap[e]) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:       if (!cut[g.tail(e)] && cut[g.head(e)] && flow[e]>0) 
marci@646: 	std::cout << "Slackness does not hold!" << std::endl;
marci@646:     }
marci@646:   }
marci@475: 
marci@475:   return 0;
marci@475: }