// -*- c++ -*-

 #include <iostream>

 #include <fstream>

 #include <vector>

 #include <cstdlib>

 #include <LEDA/graph.h>

 #include <LEDA/mcb_matching.h>

 #include <LEDA/list.h>

 #include <LEDA/graph_gen.h>

 #include <leda_graph_wrapper.h>

 #include <sage_graph.h>

 //#include <smart_graph.h>

 //#include <dimacs.h>

 #include <lemon/time_measure.h>

 #include <for_each_macros.h>

 #include <lemon/graph_wrapper.h>

 #include <bipartite_graph_wrapper.h>

 #include <lemon/maps.h>

 #include <lemon/max_flow.h>

 /**

  * Inicializalja a veletlenszamgeneratort.

  * Figyelem, ez nem jo igazi random szamokhoz,

  * erre ne bizzad a titkaidat!

  */

 void random_init()

 {

 	unsigned int seed = getpid();

 	seed |= seed << 15;

 	seed ^= time(0);

 	srand(seed);

 }

 /**

  * Egy veletlen int-et ad vissza 0 es m-1 kozott.

  */

 int random(int m)

 {

   return int( double(m) * rand() / (RAND_MAX + 1.0) );

 }

 using namespace lemon;

 int main() {

   //for leda graph

   leda::graph lg;

   //lg.make_undirected();

   typedef LedaGraphWrapper<leda::graph> Graph;

   Graph g(lg);

   //for UndirSageGraph

   //typedef UndirSageGraph Graph; 

   //Graph g;

   typedef Graph::Node Node;

   typedef Graph::NodeIt NodeIt;

   typedef Graph::Edge Edge;

   typedef Graph::EdgeIt EdgeIt;

   typedef Graph::OutEdgeIt OutEdgeIt;

   std::vector<Graph::Node> s_nodes;

   std::vector<Graph::Node> t_nodes;

   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; 

   for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode());

   for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode());

   random_init();

   for(int i=0; i<m; ++i) {

     g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);

   }

   Graph::NodeMap<int> ref_map(g, -1);

   IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);

   for (int i=0; i<a; ++i) bipartite_map.insert(s_nodes[i], false);

   for (int i=0; i<b; ++i) bipartite_map.insert(t_nodes[i], true);

   typedef BipartiteGraphWrapper<Graph> BGW;

   BGW bgw(g, bipartite_map);

   BGW::NodeMap<int> dbyj(bgw);

   BGW::EdgeMap<int> dbyxcj(bgw);

   typedef stBipartiteGraphWrapper<BGW> stGW;

   stGW stgw(bgw);

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

   Timer ts;

   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);

   ts.reset();

   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);

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

   typedef SageGraph MutableGraph;

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

 //   while (max_flow_test.augmentOnBlockingFlow2()) {

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

 //   }

   max_flow_test.run();

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

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

   ts.reset();

   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);

   max_flow_test.run();

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

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

   ts.reset();  

   leda_list<leda_edge> ml=MAX_CARD_BIPARTITE_MATCHING(lg);

   std::cout << "leda matching value: " << ml.size() << std::endl;

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

   return 0;

 }