marci@174: // -*- c++ -*-
marci@73: #include <iostream>
marci@73: #include <fstream>
marci@73: 
marci@174: #include <list_graph.h>
marci@305: #include <smart_graph.h>
marci@174: #include <dimacs.h>
marci@174: #include <edmonds_karp.h>
marci@73: #include <time_measure.h>
marci@303: //#include <graph_wrapper.h>
marci@311: #include <preflow.h>
marci@266: 
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@139: 
marci@174: 
marci@174: //   struct Ize {
marci@174: //   };
marci@139:   
marci@174: //   struct Mize {
marci@174: //     Ize bumm;
marci@174: //   };
marci@139: 
marci@174: //   template <typename B>
marci@174: //     class Huha {
marci@174: //     public:
marci@174: //       int u;
marci@174: //       B brr;
marci@174: //     };
marci@174: 
marci@139: 
marci@73: int main(int, char **) {
marci@73: 
marci@174:   typedef ListGraph MutableGraph;
marci@139: 
marci@317: //  typedef SmartGraph Graph;
marci@317:   typedef ListGraph Graph;
marci@174:   typedef Graph::Node Node;
marci@174:   typedef Graph::EdgeIt EdgeIt;
marci@139: 
marci@139: 
marci@174: //   Mize mize[10];
marci@174: //   Mize bize[0];
marci@174: //   Mize zize;
marci@174: //   typedef Mize Tize[0];
marci@146: 
marci@174: //   std::cout << &zize << " " << sizeof(mize) << sizeof(Tize) << std::endl;
marci@174: //   std::cout << sizeof(bize) << std::endl;
marci@146: 
marci@146: 
marci@174: //   Huha<Tize> k;
marci@174: //   std::cout << sizeof(k) << std::endl;
marci@139: 
marci@174: 
marci@174: //   struct Bumm {
marci@174: //     //int a;
marci@174: //     bool b;
marci@174: //   };
marci@174: 
marci@174: //   std::cout << sizeof(Bumm) << std::endl;
marci@174: 
marci@174: 
marci@174:   Graph G;
marci@174:   Node s, t;
marci@174:   Graph::EdgeMap<int> cap(G);
marci@73:   readDimacsMaxFlow(std::cin, G, s, t, cap);
marci@155: 
marci@311:   {
marci@311:     std::cout << "preflow ..." << std::endl;
marci@311:     Graph::EdgeMap<int> flow(G); //0 flow
marci@311: 
marci@311:     Timer ts;
marci@311:     ts.reset();
marci@311: 
marci@311:     Preflow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@311:       max_flow_test(G, s, t, cap, flow);
marci@311:     max_flow_test.run();
marci@311: //    int i=0;
marci@311: //    while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { 
marci@311: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@311: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@311: //     }
marci@311: //     std::cout<<std::endl;
marci@311: //      ++i; 
marci@311: //    }
marci@311: 
marci@311: //   std::cout << "maximum flow: "<< std::endl;
marci@311: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@311: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@311: //   }
marci@311: //   std::cout<<std::endl;
marci@311:     std::cout << "elapsed time: " << ts << std::endl;
marci@311: //    std::cout << "number of augmentation phases: " << i << std::endl; 
marci@311:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@311:   }
marci@73: 
marci@133:   {
marci@311:     std::cout << "physical blocking flow augmentation ..." << std::endl;
marci@303:     Graph::EdgeMap<int> flow(G); //0 flow
marci@73: 
marci@174:     Timer ts;
marci@174:     ts.reset();
marci@174: 
marci@303:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@303:       max_flow_test(G, s, t, flow, cap);
marci@174:     int i=0;
marci@174:     while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { 
marci@174: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@168: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@168: //     }
marci@168: //     std::cout<<std::endl;
marci@174:       ++i; 
marci@174:     }
marci@168: 
marci@174: //   std::cout << "maximum flow: "<< std::endl;
marci@174: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@174: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@174: //   }
marci@174: //   std::cout<<std::endl;
marci@174:     std::cout << "elapsed time: " << ts << std::endl;
marci@174:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@174:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@168:   }
marci@168: 
marci@268:   {
marci@311:     std::cout << "faster physical blocking flow augmentation ..." << std::endl;
marci@303:     Graph::EdgeMap<int> flow(G); //0 flow
marci@266: 
marci@268:     Timer ts;
marci@268:     ts.reset();
marci@266: 
marci@303:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@303:       max_flow_test(G, s, t, flow, cap);
marci@268:     int i=0;
marci@268:     while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) { 
marci@268: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@268: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@266: //     }
marci@268: //     std::cout<<std::endl;
marci@268:       ++i; 
marci@268:     }
marci@266: 
marci@268: //   std::cout << "maximum flow: "<< std::endl;
marci@268: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@268: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@266: //   }
marci@268: //   std::cout<<std::endl;
marci@268:     std::cout << "elapsed time: " << ts << std::endl;
marci@268:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@268:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@268:   }
marci@266: 
marci@269:   {
marci@311:     std::cout << "on-the-fly blocking flow augmentation ..." << std::endl;
marci@303:     Graph::EdgeMap<int> flow(G); //0 flow
marci@266: 
marci@269:     Timer ts;
marci@269:     ts.reset();
marci@266: 
marci@303:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@303:       max_flow_test(G, s, t, flow, cap);
marci@269:     int i=0;
marci@269:     while (max_flow_test.augmentOnBlockingFlow2()) { 
marci@269: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@269: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@266: //     }
marci@269: //     std::cout<<std::endl;
marci@269:       ++i; 
marci@269:     }
marci@266: 
marci@269: //   std::cout << "maximum flow: "<< std::endl;
marci@269: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@269: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@266: //   }
marci@269: //   std::cout<<std::endl;
marci@269:     std::cout << "elapsed time: " << ts << std::endl;
marci@269:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@269:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@269:   }
marci@266: 
marci@168:   {
marci@311:     std::cout << "on-the-fly shortest path augmentation ..." << std::endl;
marci@303:     Graph::EdgeMap<int> flow(G); //0 flow
marci@206: 
marci@206:     Timer ts;
marci@206:     ts.reset();
marci@206: 
marci@303:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > 
marci@303:       max_flow_test(G, s, t, flow, cap);
marci@174:     int i=0;
marci@174:     while (max_flow_test.augmentOnShortestPath()) { 
marci@174: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@168: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@168: //     }
marci@168: //     std::cout<<std::endl;
marci@174:       ++i; 
marci@174:     }
marci@174: 
marci@174: //   std::cout << "maximum flow: "<< std::endl;
marci@174: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@174: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@174: //   }
marci@174: //   std::cout<<std::endl;
marci@174:     std::cout << "elapsed time: " << ts << std::endl;
marci@174:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@174:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@168:   }
marci@133: 
marci@73: 
marci@73:   return 0;
marci@73: }