jacint@131: #include <iostream>
jacint@131: #include <fstream>
jacint@131: 
jacint@131: #include <j_graph.h>
jacint@131: #include <dimacs_jgraph.hh>
jacint@131: #include <preflow_jgraph.h>
jacint@131: #include <time_measure.h>
jacint@131: 
jacint@131: using namespace hugo;
jacint@131: 
jacint@131: // Use a DIMACS max flow file as stdin.
jacint@131: // read_dimacs_demo < dimacs_max_flow_file
jacint@131: int main(int, char **) {
jacint@131:   typedef JGraph::TrivNodeIt TrivNodeIt;
jacint@131:   typedef JGraph::EdgeIt EdgeIt;
jacint@131: 
jacint@131:   JGraph G;
jacint@131:   TrivNodeIt s, t;
jacint@131:   JGraph::EdgeMap<int> cap(G);
jacint@131:   readDimacsMaxFlow(std::cin, G, s, t, cap);
jacint@131: 
jacint@131:   std::cout << "preflow demo jacint ..." << std::endl;
jacint@131:   
jacint@131:   double mintime=1000000;
jacint@131: 
jacint@131:   for ( int i=1; i!=11; ++i ) {
jacint@131:     double pre_time=currTime();
jacint@131:     preflow<JGraph, int> max_flow_test(G, s, t, cap);
jacint@131:     double post_time=currTime();
jacint@131:     if ( mintime > post_time-pre_time ) mintime = post_time-pre_time;
jacint@131:   }
jacint@131: 
jacint@131:   double pre_time=currTime();
jacint@131:     preflow<JGraph, int> max_flow_test(G, s, t, cap);
jacint@131:   double post_time=currTime();
jacint@131:     
jacint@131:   JGraph::NodeMap<bool> cut(G);
jacint@131:   max_flow_test.minCut(cut); 
jacint@131:   int min_cut_value=0;
jacint@131:   for(EdgeIt e=G.firstEdge(); e; G.next(e)) {
jacint@131:     if (cut.get(G.tail(e)) && !cut.get(G.head(e))) min_cut_value+=cap.get(e);
jacint@131:   }
jacint@131: 
jacint@131:   JGraph::NodeMap<bool> cut1(G);
jacint@131:   max_flow_test.minMinCut(cut1); 
jacint@131:   int min_min_cut_value=0;
jacint@131:   for(EdgeIt e=G.firstEdge(); e; G.next(e)) {
jacint@131:     if (cut.get(G.tail(e)) && !cut.get(G.head(e))) 
jacint@131:       min_min_cut_value+=cap.get(e);
jacint@131:   }
jacint@131: 
jacint@131:   JGraph::NodeMap<bool> cut2(G);
jacint@131:   max_flow_test.maxMinCut(cut2); 
jacint@131:   int max_min_cut_value=0;
jacint@131:   for(EdgeIt e=G.firstEdge(); e; G.next(e)) {
jacint@131:     if (cut2.get(G.tail(e)) && !cut2.get(G.head(e))) 
jacint@131:       max_min_cut_value+=cap.get(e);
jacint@131:   }
jacint@131:   
jacint@131:   std::cout << "min time of 10 runs: " << mintime << " sec"<< std::endl; 
jacint@131:   std::cout << "phase 0: " << max_flow_test.time-pre_time 
jacint@131: 	    << " sec"<< std::endl; 
jacint@131:   std::cout << "phase 1: " << post_time-max_flow_test.time 
jacint@131: 	    << " sec"<< std::endl; 
jacint@131:   std::cout << "flow value: "<< max_flow_test.maxFlow() << std::endl;
jacint@131:   std::cout << "min cut value: "<< min_cut_value << std::endl;
jacint@131:   std::cout << "min min cut value: "<< min_min_cut_value << std::endl;
jacint@131:   std::cout << "max min cut value: "<< max_min_cut_value << 
jacint@131:     std::endl<< std::endl;
jacint@131:   
jacint@131:   return 0;
jacint@131: }