// -*- c++ -*-

#include <iostream>

#include <fstream>

#include <vector>

#include <sage_graph.h>

//#include <smart_graph.h>

//#include <dimacs.h>

#include <hugo/time_measure.h>

#include <for_each_macros.h>

#include <bfs_dfs.h>

#include <bipartite_graph_wrapper.h>

#include <hugo/maps.h>

#include <hugo/max_flow.h>

#include <graph_gen.h>

#include <max_bipartite_matching.h>

using namespace hugo;

int main() {

  //typedef UndirListGraph Graph; 

  typedef BipartiteGraph<SageGraph> Graph;

  typedef Graph::Node Node;

  typedef Graph::NodeIt NodeIt;

  typedef Graph::Edge Edge;

  typedef Graph::EdgeIt EdgeIt;

  typedef Graph::OutEdgeIt OutEdgeIt;

  Graph g;

  int a;

  std::cout << "number of nodes in the first color class=";

  std::cin >> a; 

  int b;

  std::cout << "number of nodes in the second color class=";

  std::cin >> b; 

  int m;

  std::cout << "number of edges=";

  std::cin >> m; 

  std::cout << "Generatig a random bipartite graph..." << std::endl;

  random_init();

  randomBipartiteGraph(g, a, b, m);

//   std::cout << "Edges of the bipartite graph:" << std::endl;

//   FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " ";

//   std::cout << std::endl;

//   std::cout << "Nodes:" << std::endl;

//   FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " ";

//   std::cout << std::endl;

//   std::cout << "Nodes in T:" << std::endl;

//   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";

//   std::cout << std::endl;

//   std::cout << "Nodes in S:" << std::endl;

//   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";

//   std::cout << std::endl;

//   std::cout << "Erasing the first node..." << std::endl;

//   NodeIt n;

//   g.first(n);

//   g.erase(n);

//   std::cout << "Nodes of the bipartite graph:" << std::endl;

//   FOR_EACH_GLOB(n, g) std::cout << n << " ";

//   std::cout << std::endl;

//   std::cout << "Nodes in T:" << std::endl;

//   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";

//   std::cout << std::endl;

//   std::cout << "Nodes in S:" << std::endl;

//   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";

//   std::cout << std::endl;

  typedef stGraphWrapper<Graph> stGW;

  stGW stgw(g);

  ConstMap<stGW::Edge, int> const1map(1);

  Timer ts;

  ts.reset();

  stGW::EdgeMap<int> flow(stgw);

  MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 

    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow);

  max_flow_test.run();

//  while (max_flow_test.augmentOnShortestPath()) { }

//  typedef ListGraph MutableGraph;

//  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {

//  while (max_flow_test.augmentOnBlockingFlow2()) {

//   std::cout << max_flow_test.flowValue() << std::endl;

//  }

  std::cout << "max flow value: " << max_flow_test.flowValue() << std::endl;

  std::cout << "elapsed time: " << ts << std::endl;

//   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 

//     if (flow[e]) std::cout << e << std::endl; 

//   }

  std::cout << std::endl;

  typedef ConstMap<Graph::Edge, int> EdgeCap; 

  EdgeCap ge1(1);

  typedef ConstMap<Graph::Node, int> NodeCap;

  NodeCap gn1(1);

  typedef Graph::EdgeMap<int> EdgeFlow;

  EdgeFlow gef(g); //0

  typedef Graph::NodeMap<int> NodeFlow; 

  NodeFlow gnf(g); //0 

  typedef stGraphWrapper<Graph>::EdgeMapWrapper<EdgeCap, NodeCap> CapMap; 

  typedef stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> FlowMap; 

  CapMap cm(ge1, gn1);

  FlowMap fm(gef, gnf);

  //Timer ts;

  ts.reset();

  //stGW::EdgeMap<int> flow(stgw);

  MaxFlow<stGW, int, CapMap, FlowMap> 

    max_flow_test1(stgw, stgw.S_NODE, stgw.T_NODE, cm, fm);

  max_flow_test1.run();

//  while (max_flow_test.augmentOnShortestPath()) { }

//  typedef ListGraph MutableGraph;

//  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {

//  while (max_flow_test.augmentOnBlockingFlow2()) {

//   std::cout << max_flow_test.flowValue() << std::endl;

//  }

  std::cout << "max flow value: " << max_flow_test1.flowValue() << std::endl;

  std::cout << "elapsed time: " << ts << std::endl;

//   FOR_EACH_LOC(Graph::EdgeIt, e, g) { 

//     if (gef[e]) std::cout << e << std::endl; 

//   }

  std::cout << std::endl;

  ts.reset();

  FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); 

  FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); 

  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 

    Graph::EdgeMap<int>, Graph::NodeMap<int> > 

    matching_test(g, ge1, gn1, gef, gnf);

  matching_test.run();

  std::cout << "max flow value: " << matching_test.matchingValue() << std::endl;

  std::cout << "elapsed time: " << ts << std::endl;

//   FOR_EACH_LOC(Graph::EdgeIt, e, g) { 

//     if (gef[e]) std::cout << e << std::endl; 

//   }

  std::cout << std::endl;

  ts.reset();

  FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); 

  //FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); 

  MaxBipartiteMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 

    Graph::EdgeMap<int>, Graph::NodeMap<int> > 

    matching_test_1(g, ge1, gn1, gef/*, gnf*/);

  matching_test_1.run();

  std::cout << "max flow value: " << matching_test_1.matchingValue() << std::endl;

  std::cout << "elapsed time: " << ts << std::endl;

//   FOR_EACH_LOC(Graph::EdgeIt, e, g) { 

//     if (gef[e]) std::cout << e << std::endl; 

//   }

  std::cout << std::endl;

  return 0;

}