marci@73: #include <iostream>
marci@73: #include <fstream>
marci@73: 
marci@73: #include <list_graph.hh>
marci@73: #include <dimacs.hh>
marci@73: #include <edmonds_karp.hh>
marci@73: #include <time_measure.h>
marci@73: 
alpar@105: using namespace hugo;
marci@73: 
marci@73: // Use a DIMACS max flow file as stdin.
marci@73: // read_dimacs_demo < dimacs_max_flow_file
marci@73: int main(int, char **) {
marci@73:   typedef ListGraph::NodeIt NodeIt;
marci@73:   typedef ListGraph::EachEdgeIt EachEdgeIt;
marci@73: 
marci@73:   ListGraph G;
marci@73:   NodeIt s, t;
marci@73:   ListGraph::EdgeMap<int> cap(G);
marci@73:   readDimacsMaxFlow(std::cin, G, s, t, cap);
marci@73: 
marci@133:   {
marci@133:   std::cout << "edmonds karp demo (blocking flow augmentation)..." << std::endl;
marci@73:   ListGraph::EdgeMap<int> flow(G); //0 flow
marci@73: 
marci@73:   double pre_time=currTime();
marci@73:   MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@133:   //max_flow_test.augmentWithBlockingFlow<ListGraph>();
marci@133:   max_flow_test.run<ListGraph>();
marci@73:   double post_time=currTime();
marci@133: 
marci@73:   //std::cout << "maximum flow: "<< std::endl;
marci@73:   //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { 
marci@73:   //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@73:   //}
marci@73:   //std::cout<<std::endl;
marci@73:   std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
marci@73:   std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@133:   }
marci@133: 
marci@133:   {
marci@133:   std::cout << "edmonds karp demo (shortest path augmentation)..." << std::endl;
marci@133:   ListGraph::EdgeMap<int> flow(G); //0 flow
marci@133: 
marci@133:   double pre_time=currTime();
marci@133:   MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@133:   //max_flow_test.augmentWithBlockingFlow<ListGraph>();
marci@133:   max_flow_test.run();
marci@133:   double post_time=currTime();
marci@133: 
marci@133:   //std::cout << "maximum flow: "<< std::endl;
marci@133:   //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { 
marci@133:   //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@133:   //}
marci@133:   //std::cout<<std::endl;
marci@133:   std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
marci@133:   std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@133:   }
marci@73: 
marci@73:   return 0;
marci@73: }