marci@510: // -*- c++ -*-
marci@510: #include <iostream>
marci@510: #include <fstream>
marci@510: #include <vector>
marci@510: #include <cstdlib>
marci@510: 
marci@510: #include <list_graph.h>
marci@510: //#include <smart_graph.h>
marci@510: //#include <dimacs.h>
marci@510: #include <time_measure.h>
marci@510: #include <for_each_macros.h>
marci@510: #include <bfs_iterator.h>
marci@510: #include <bipartite_graph_wrapper.h>
marci@510: #include <maps.h>
marci@510: #include <max_flow.h>
marci@510: 
marci@510: using namespace hugo;
marci@510: 
marci@510: // template <typename Graph, typename EdgeCap, typename NodeCap, 
marci@510: // 	  typename EdgeFlow, typename NodeFlow>
marci@510: // class MaxMatching : public MaxFlow<stGraphWrapper<Graph>, 
marci@510: // 				   stGraphWrapper<Graph>:: EdgeMapWrapper<EdgeCan, NodeCap>, stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> > {
marci@510: //   typedef MaxFlow<stGraphWrapper<Graph>, 
marci@510: // 		  stGraphWrapper<Graph>::EdgeMapWrapper<EdgeCan, NodeCap>, 
marci@510: // 		  stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> >
marci@510: //   Parent;
marci@510: // protected:
marci@510: //   stGraphWrapper<Graph> gw;
marci@510: //   stGraphWrapper<Graph>::EdgeMapWrapper<EdgeCap, NodeCap> cap;
marci@510: //   stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> flow;
marci@510: //   //graph* g;
marci@510: //   //EdgeCap* edge_cap;
marci@510: //   //EdgeFlow* edge_flow;
marci@510: // public:
marci@510: //   MaxMatching(Graph& _g, EdgeCap& _edge_cap, NodeCap& _node_cap, 
marci@510: // 	      EdgeFlow& _edge_flow, NodeFlow& _node_flow) : 
marci@510: //     MaxFlow(), gw(_g), 
marci@510: //     cap(_edge_cap, _node_cap), flow(_edge_flow, _node_flow) {
marci@510: //     Parent::set(gw, cap, flow);
marci@510: //   }
marci@510: // };
marci@510: 
marci@510: template <typename Graph, typename EdgeCap, typename NodeCap, 
marci@510: 	  typename EdgeFlow, typename NodeFlow>
marci@510: class MaxMatching {
marci@510: // : public MaxFlow<stGraphWrapper<Graph>, 
marci@510: // 				   stGraphWrapper<Graph>:: EdgeMapWrapper<EdgeCan, NodeCap>, stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> > {
marci@510: //   typedef MaxFlow<stGraphWrapper<Graph>, 
marci@510: // 		  stGraphWrapper<Graph>::EdgeMapWrapper<EdgeCan, NodeCap>, 
marci@510: // 		  stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> >
marci@510: //   Parent;
marci@510: protected:
marci@510: //   EdgeCap* edge_cap;
marci@510: //   NodeCap* node_cap;
marci@510: //   EdgeFlow* edge_flow;
marci@510: //   NodeFlow* node_flow;
marci@510:   typedef  stGraphWrapper<Graph> stGW;
marci@510:   stGW stgw;
marci@510:   typedef typename stGW::template EdgeMapWrapper<EdgeCap, NodeCap> CapMap; 
marci@510:   CapMap cap;
marci@510:   typedef typename stGW::template EdgeMapWrapper<EdgeFlow, NodeFlow> FlowMap;
marci@510:   FlowMap flow;
marci@510:   MaxFlow<stGW, int, CapMap, FlowMap> mf;
marci@510:   //graph* g;
marci@510:   //EdgeCap* edge_cap;
marci@510:   //EdgeFlow* edge_flow;
marci@510: public:
marci@510:   MaxMatching(Graph& _g, EdgeCap& _edge_cap, NodeCap& _node_cap, 
marci@510: 	      EdgeFlow& _edge_flow, NodeFlow& _node_flow) : 
marci@510:     stgw(_g), 
marci@510:     cap(_edge_cap, _node_cap), flow(_edge_flow, _node_flow), 
marci@510:     mf(stgw, stgw.S_NODE, stgw.T_NODE, cap, flow) { }
marci@510:   void run() { mf.run(); } 
marci@510:   int matchingValue() { return mf.flowValue(); }
marci@510: };
marci@510: 
marci@510: /**
marci@510:  * Inicializalja a veletlenszamgeneratort.
marci@510:  * Figyelem, ez nem jo igazi random szamokhoz,
marci@510:  * erre ne bizzad a titkaidat!
marci@510:  */
marci@510: void random_init()
marci@510: {
marci@510: 	unsigned int seed = getpid();
marci@510: 	seed |= seed << 15;
marci@510: 	seed ^= time(0);
marci@510: 
marci@510: 	srand(seed);
marci@510: }
marci@510: 
marci@510: /**
marci@510:  * Egy veletlen int-et ad vissza 0 es m-1 kozott.
marci@510:  */
marci@510: int random(int m)
marci@510: {
marci@510:   return int( double(m) * rand() / (RAND_MAX + 1.0) );
marci@510: }
marci@510: 
marci@510: int main() {
marci@510:   //typedef UndirListGraph Graph; 
marci@510:   typedef BipartiteGraph<ListGraph> Graph;
marci@510:   
marci@510:   typedef Graph::Node Node;
marci@510:   typedef Graph::NodeIt NodeIt;
marci@510:   typedef Graph::Edge Edge;
marci@510:   typedef Graph::EdgeIt EdgeIt;
marci@510:   typedef Graph::OutEdgeIt OutEdgeIt;
marci@510: 
marci@510:   Graph g;
marci@510: 
marci@510:   std::vector<Graph::Node> s_nodes;
marci@510:   std::vector<Graph::Node> t_nodes;
marci@510: 
marci@510:   int a;
marci@510:   std::cout << "number of nodes in the first color class=";
marci@510:   std::cin >> a; 
marci@510:   int b;
marci@510:   std::cout << "number of nodes in the second color class=";
marci@510:   std::cin >> b; 
marci@510:   int m;
marci@510:   std::cout << "number of edges=";
marci@510:   std::cin >> m; 
marci@510:   
marci@510:   std::cout << "Generatig a random bipartite graph..." << std::endl;
marci@510:   for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode(false));
marci@510:   for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode(true));
marci@510: 
marci@510:   random_init();
marci@510:   for(int i=0; i<m; ++i) {
marci@510:     g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);
marci@510:   }
marci@510: 
marci@510:   std::cout << "Edges of the bipartite graph:" << std::endl;
marci@510:   FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " ";
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   std::cout << "Nodes:" << std::endl;
marci@510:   FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " ";
marci@510:   std::cout << std::endl;
marci@510:   std::cout << "Nodes in T:" << std::endl;
marci@510:   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
marci@510:   std::cout << std::endl;
marci@510:   std::cout << "Nodes in S:" << std::endl;
marci@510:   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   std::cout << "Erasing the first node..." << std::endl;
marci@510:   NodeIt n;
marci@510:   g.first(n);
marci@510:   g.erase(n);
marci@510:   std::cout << "Nodes of the bipartite graph:" << std::endl;
marci@510:   FOR_EACH_GLOB(n, g) std::cout << n << " ";
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   std::cout << "Nodes in T:" << std::endl;
marci@510:   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
marci@510:   std::cout << std::endl;
marci@510:   std::cout << "Nodes in S:" << std::endl;
marci@510:   FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   typedef stGraphWrapper<Graph> stGW;
marci@510:   stGW stgw(g);
marci@510:   ConstMap<stGW::Edge, int> const1map(1);
marci@510: 
marci@510:   Timer ts;
marci@510:   ts.reset();
marci@510:   stGW::EdgeMap<int> flow(stgw);
marci@510:   MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
marci@510:     max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow);
marci@510:   max_flow_test.run();
marci@510: //  while (max_flow_test.augmentOnShortestPath()) { }
marci@510: //  typedef ListGraph MutableGraph;
marci@510: //  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
marci@510: //  while (max_flow_test.augmentOnBlockingFlow2()) {
marci@510: //   std::cout << max_flow_test.flowValue() << std::endl;
marci@510: //  }
marci@510:   std::cout << "max flow value: " << max_flow_test.flowValue() << std::endl;
marci@510:   std::cout << "elapsed time: " << ts << std::endl;
marci@510:   FOR_EACH_LOC(stGW::EdgeIt, e, stgw) { 
marci@510:     if (flow[e]) std::cout << e << std::endl; 
marci@510:   }
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   typedef ConstMap<Graph::Edge, int> EdgeCap; 
marci@510:   EdgeCap ge1(1);
marci@510:   typedef ConstMap<Graph::Node, int> NodeCap;
marci@510:   NodeCap gn1(1);
marci@510:   typedef Graph::EdgeMap<int> EdgeFlow;
marci@510:   EdgeFlow gef(g); //0
marci@510:   typedef Graph::NodeMap<int> NodeFlow; 
marci@510:   NodeFlow gnf(g); //0 
marci@510: 
marci@510:   typedef stGraphWrapper<Graph>::EdgeMapWrapper<EdgeCap, NodeCap> CapMap; 
marci@510:   typedef stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> FlowMap; 
marci@510:   CapMap cm(ge1, gn1);
marci@510:   FlowMap fm(gef, gnf);
marci@510: 
marci@510:   //Timer ts;
marci@510:   ts.reset();
marci@510:   //stGW::EdgeMap<int> flow(stgw);
marci@510:   MaxFlow<stGW, int, CapMap, FlowMap> 
marci@510:     max_flow_test1(stgw, stgw.S_NODE, stgw.T_NODE, cm, fm);
marci@510:   max_flow_test1.run();
marci@510: //  while (max_flow_test.augmentOnShortestPath()) { }
marci@510: //  typedef ListGraph MutableGraph;
marci@510: //  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
marci@510: //  while (max_flow_test.augmentOnBlockingFlow2()) {
marci@510: //   std::cout << max_flow_test.flowValue() << std::endl;
marci@510: //  }
marci@510:   std::cout << "max flow value: " << max_flow_test1.flowValue() << std::endl;
marci@510:   std::cout << "elapsed time: " << ts << std::endl;
marci@510: //   FOR_EACH_LOC(Graph::EdgeIt, e, g) { 
marci@510: //     if (gef[e]) std::cout << e << std::endl; 
marci@510: //   }
marci@510:   std::cout << std::endl;
marci@510: 
marci@510:   ts.reset();
marci@510:   FOR_EACH_LOC(Graph::EdgeIt, e, g) gef.set(e, 0); 
marci@510:   FOR_EACH_LOC(Graph::NodeIt, n, g) gnf.set(n, 0); 
marci@510:   MaxMatching<Graph, ConstMap<Graph::Edge, int>, ConstMap<Graph::Node, int>, 
marci@510:     Graph::EdgeMap<int>, Graph::NodeMap<int> > 
marci@510:     matching_test(g, ge1, gn1, gef, gnf);
marci@510:   matching_test.run();
marci@510: 
marci@510:   std::cout << "max flow value: " << matching_test.matchingValue() << std::endl;
marci@510:   std::cout << "elapsed time: " << ts << std::endl;
marci@510: //   FOR_EACH_LOC(Graph::EdgeIt, e, g) { 
marci@510: //     if (gef[e]) std::cout << e << std::endl; 
marci@510: //   }
marci@510:   std::cout << std::endl;
marci@510:   return 0;
marci@510: }