marci@82: #include <iostream>
marci@82: #include <fstream>
marci@82: 
marci@82: #include <list_graph.hh>
marci@82: #include <dimacs.hh>
marci@82: #include <preflow_push_max_flow.h>
marci@87: #include <preflow_push_hl.h>
marci@82: #include <time_measure.h>
marci@82: 
alpar@921: using namespace lemon;
marci@82: 
marci@82: // Use a DIMACS max flow file as stdin.
marci@82: // read_dimacs_demo < dimacs_max_flow_file
marci@82: int main(int, char **) {
marci@82:   typedef ListGraph::NodeIt NodeIt;
marci@82:   typedef ListGraph::EachEdgeIt EachEdgeIt;
marci@82: 
marci@82:   ListGraph G;
marci@82:   NodeIt s, t;
marci@82:   ListGraph::EdgeMap<int> cap(G);
marci@82:   readDimacsMaxFlow(std::cin, G, s, t, cap);
marci@82: 
marci@87:   {
marci@87:   std::cout << "preflow demo (preflow_push_max_flow by JACINT)..." << std::endl;
marci@82:   //ListGraph::EdgeMap<int> flow(G); //0 flow
marci@82: 
marci@82:   double pre_time=currTime();
marci@82:   preflow_push_max_flow<ListGraph, int> max_flow_test(G, s, t, cap);
marci@82:   max_flow_test.run();
marci@100:   ListGraph::NodeMap<bool> cut(G); 
marci@100:   max_flow_test.mincut(cut);
marci@82:   int cut_value=0;
marci@82:   for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
marci@82:     if (cut.get(G.tail(e)) && !cut.get(G.head(e))) cut_value+=cap.get(e);
marci@82:   }
marci@82:   double post_time=currTime();
marci@82:   //std::cout << "maximum flow: "<< std::endl;
marci@82:   //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { 
marci@82:   //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@82:   //}
marci@82:   //std::cout<<std::endl;
marci@82:   std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
marci@82:   std::cout << "flow value: "<< max_flow_test.maxflow() << std::endl;
marci@82:   std::cout << "cut value: "<< cut_value << std::endl;
marci@87:   }
marci@87: 
marci@87:     {
marci@87:   std::cout << "preflow demo (preflow_push_hl by JACINT)..." << std::endl;
marci@87:   //ListGraph::EdgeMap<int> flow(G); //0 flow
marci@87: 
marci@87:   double pre_time=currTime();
marci@87:   preflow_push_hl<ListGraph, int> max_flow_test(G, s, t, cap);
marci@87:   max_flow_test.run();
marci@100:   ListGraph::NodeMap<bool> cut(G);
marci@100:   max_flow_test.mincut(cut);
marci@87:   int cut_value=0;
marci@87:   for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
marci@87:     if (cut.get(G.tail(e)) && !cut.get(G.head(e))) cut_value+=cap.get(e);
marci@87:   }
marci@87:   double post_time=currTime();
marci@87:   //std::cout << "maximum flow: "<< std::endl;
marci@87:   //for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) { 
marci@87:   //  std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@87:   //}
marci@87:   //std::cout<<std::endl;
marci@87:   std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
marci@87:   std::cout << "flow value: "<< max_flow_test.maxflow() << std::endl;
marci@87:   std::cout << "cut value: "<< cut_value << std::endl;
marci@87:   }
marci@89: 
marci@82: 
marci@82:   return 0;
marci@82: }