marci@174: // -*- c++ -*-
marci@73: #include <iostream>
marci@73: #include <fstream>
marci@73: 
marci@174: #include <list_graph.h>
marci@174: #include <smart_graph.h>
marci@174: #include <dimacs.h>
marci@174: #include <edmonds_karp.h>
marci@73: #include <time_measure.h>
marci@155: #include <graph_wrapper.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@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@206:   typedef SmartGraph Graph;
marci@206:   //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@174: //   typedef TrivGraphWrapper<Graph> TGW;
marci@174: //   TGW gw(G);
marci@174: //   TGW::NodeIt sw;
marci@174: //   gw./*getF*/first(sw);
marci@174: //   std::cout << "p1:" << gw.nodeNum() << std::endl;
marci@174: //   gw.erase(sw);
marci@174: //   std::cout << "p2:" << gw.nodeNum() << std::endl;
marci@174: 
marci@174: //   typedef const Graph cLG;
marci@174: //   typedef TrivGraphWrapper<const cLG> CTGW;
marci@174: //   CTGW cgw(G);
marci@174: //   CTGW::NodeIt csw;
marci@174: //   cgw./*getF*/first(csw);
marci@174: //   std::cout << "p1:" << cgw.nodeNum() << std::endl;
marci@174: //   //cgw.erase(csw);
marci@174: //   std::cout << "p2:" << cgw.nodeNum() << std::endl;
marci@174: 
marci@73: 
marci@133:   {
marci@174:     std::cout << "SmartGraph..." << std::endl;
marci@174:     std::cout << "edmonds karp demo (physical blocking flow augmentation)..." << std::endl;
marci@174:     Graph::EdgeMap<int> flow(G); //0 flow
marci@73: 
marci@174:     Timer ts;
marci@174:     ts.reset();
marci@174: 
marci@174:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@174:     //max_flow_test.augmentWithBlockingFlow<Graph>();
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@168:   {
marci@206:     std::cout << "SmartGraph..." << std::endl;
marci@206:     std::cout << "edmonds karp demo (physical blocking flow 1 augmentation)..." << std::endl;
marci@206:     Graph::EdgeMap<int> flow(G); //0 flow
marci@206: 
marci@206:     Timer ts;
marci@206:     ts.reset();
marci@206: 
marci@206:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@206:     //max_flow_test.augmentWithBlockingFlow<Graph>();
marci@206:     int i=0;
marci@206:     while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) { 
marci@206: //     for(EdgeIt e=G.template first<EdgeIt>(); e.valid(); ++e) { 
marci@206: //       std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@206: //     }
marci@206: //     std::cout<<std::endl;
marci@206:       ++i; 
marci@206:     }
marci@206: 
marci@206: //   std::cout << "maximum flow: "<< std::endl;
marci@206: //   for(EdgeIt e=G.first<EdgeIt>(); e.valid(); ++e) { 
marci@206: //     std::cout<<"("<<G.tail(e)<< "-"<<flow.get(e)<<"->"<<G.head(e)<<") ";
marci@206: //   }
marci@206: //   std::cout<<std::endl;
marci@206:     std::cout << "elapsed time: " << ts << std::endl;
marci@206:     std::cout << "number of augmentation phases: " << i << std::endl; 
marci@206:     std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
marci@206:   }
marci@206: 
marci@206:   {
marci@174:     std::cout << "edmonds karp demo (on-the-fly blocking flow augmentation)..." << std::endl;
marci@174:     Graph::EdgeMap<int> flow(G); //0 flow
marci@168: 
marci@174:     Timer ts;
marci@174:     ts.reset();
marci@174: 
marci@174:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@174:     //max_flow_test.augmentWithBlockingFlow<Graph>();
marci@174:     int i=0;
marci@174:     while (max_flow_test.augmentOnBlockingFlow2()) { 
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@133: 
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@133:   }
marci@133: 
marci@133:   {
marci@174:     std::cout << "edmonds karp demo (on-the-fly shortest path augmentation)..." << std::endl;
marci@174:     Graph::EdgeMap<int> flow(G); //0 flow
marci@133: 
marci@174:     Timer ts;
marci@174:     ts.reset();
marci@174: 
marci@174:     MaxFlow<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
marci@174:     //max_flow_test.augmentWithBlockingFlow<Graph>();
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: }