Changeset 409:7ab7f083760a in lemon-0.x for src/work/marci/bipartite_graph_wrapper_test.cc

Timestamp:

04/26/04 11:54:24 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@542

Message:

stGraphWrapper is almost working

File:

• src/work/marci/bipartite_graph_wrapper_test.cc (modified) (2 diffs)

src/work/marci/bipartite_graph_wrapper_test.cc

@@ -25 +25 @@
 
   Graph g;
-  //Node s, t;
-  //Graph::EdgeMap<int> cap(g);
-  //readDimacsMaxFlow(std::cin, g, s, t, cap);
-  std::vector<Graph::Node> s_nodes;
-  std::vector<Graph::Node> t_nodes;
-  for (int i=0; i<3; ++i) s_nodes.push_back(g.addNode());
-  for (int i=0; i<3; ++i) t_nodes.push_back(g.addNode());
-  g.addEdge(s_nodes[0], t_nodes[2]);
-  g.addEdge(t_nodes[1], s_nodes[2]);
+//   std::vector<Graph::Node> s_nodes;
+//   std::vector<Graph::Node> t_nodes;
+//   for (int i=0; i<3; ++i) s_nodes.push_back(g.addNode());
+//   for (int i=0; i<3; ++i) t_nodes.push_back(g.addNode());
+//   g.addEdge(s_nodes[0], t_nodes[2]);
+//   g.addEdge(t_nodes[1], s_nodes[2]);
+//   g.addEdge(s_nodes[0], t_nodes[1]);
+  
+//   Graph::NodeMap<int> ref_map(g, -1);
+//   IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);
+//   for (int i=0; i<3; ++i) bipartite_map.insert(s_nodes[i], false);
+//   for (int i=0; i<3; ++i) bipartite_map.insert(t_nodes[i], true);
+
+  std::vector<Graph::Node> nodes;
+  for (int i=0; i<3; ++i) nodes.push_back(g.addNode());
+  for (int i=3; i<6; ++i) nodes.push_back(g.addNode());
+  g.addEdge(nodes[0], nodes[3+2]);
+  g.addEdge(nodes[3+1], nodes[2]);
+  g.addEdge(nodes[0], nodes[3+1]);
   
   Graph::NodeMap<int> ref_map(g, -1);
   IterableBoolMap< Graph::NodeMap<int> > bipartite_map(ref_map);
-  for (int i=0; i<3; ++i) bipartite_map.insert(s_nodes[i], false);
-  for (int i=0; i<3; ++i) bipartite_map.insert(t_nodes[i], true);
+  for (int i=0; i<3; ++i) bipartite_map.insert(nodes[i], false);
+  for (int i=3; i<6; ++i) bipartite_map.insert(nodes[i], true);
+
+  Graph::Node u;
+  std::cout << "These nodes will be in S:\n";
+  //FIXME azert kellene ++, es invalid vizsgalat u-bol, hogy ezt le lehessen 
+  //irni 1etlen FOR_EACH-csel.
+  for (bipartite_map.first(u, false); g.valid(u); bipartite_map.next(u)) 
+    std::cout << u << " ";
+  std::cout << "\n";
+  std::cout << "These nodes will be in T:\n";
+  for (bipartite_map.first(u, true); g.valid(u); bipartite_map.next(u)) 
+    std::cout << u << " ";
+  std::cout << "\n";
+
   typedef BipartiteGraphWrapper<Graph> BGW;
   BGW bgw(g, bipartite_map);
+
+  std::cout << "Nodes by NodeIt:\n";
+  FOR_EACH_LOC(BGW::NodeIt, n, bgw) {
+    std::cout << n << " ";
+  }
+  std::cout << "\n";
+  std::cout << "Nodes in S by ClassNodeIt:\n";
+  FOR_EACH_INC_LOC(BGW::ClassNodeIt, n, bgw, bgw.S_CLASS) {
+    std::cout << n << " ";
+  }
+  std::cout << "\n";
+  std::cout << "Nodes in T by ClassNodeIt:\n";
+  FOR_EACH_INC_LOC(BGW::ClassNodeIt, n, bgw, bgw.T_CLASS) {
+    std::cout << n << " ";
+  }
+  std::cout << "\n";
+  std::cout << "Edges of the bipartite graph:\n";
   FOR_EACH_LOC(BGW::EdgeIt, e, bgw) {
     std::cout << bgw.tail(e) << "->" << bgw.head(e) << std::endl;
@@ -59 +99 @@
   s=g.first(si);
   bfs.pushAndSetReached(BGW::Node(s));
-  while (!bfs.finished()) ++bfs;
+  while (!bfs.finished()) { ++bfs; }
 
-  BGW::EdgeMap<bool> cap(bgw);
-  BGW::EdgeMap<bool> flow1(bgw);
+  FOR_EACH_LOC(stGW::NodeIt, n, stgw) { 
+    std::cout << "out-edges of " << n << ":\n"; 
+    FOR_EACH_INC_LOC(stGW::OutEdgeIt, e, stgw, n) { 
+      std::cout << " " << e << "\n";
+      std::cout << " aNode: " << stgw.aNode(e) << "\n";
+      std::cout << " bNode: " << stgw.bNode(e) << "\n";      
+    }
+    std::cout << "in-edges of " << n << ":\n"; 
+    FOR_EACH_INC_LOC(stGW::InEdgeIt, e, stgw, n) { 
+      std::cout << " " << e << "\n";
+      std::cout << " aNode: " << stgw.aNode(e) << "\n";
+      std::cout << " bNode: " << stgw.bNode(e) << "\n";     
+    }
+  }
+  std::cout << "Edges of the stGraphWrapper:\n"; 
+  FOR_EACH_LOC(stGW::EdgeIt, n, stgw) { 
+    std::cout << " " << n << "\n";
+  }
 
-  typedef ResGraphWrapper< BGW, int, BGW::EdgeMap<bool>, BGW::EdgeMap<bool> > 
-    RBGW;
-  RBGW rbgw(bgw, cap, flow1);
-  RBGW::NodeMap<int> u(rbgw);
+  stGW::NodeMap<bool> b(stgw);
+  FOR_EACH_LOC(stGW::NodeIt, n, stgw) { 
+    std::cout << n << ": " << b[n] <<"\n";
+  }
+
+  std::cout << "Bfs from s: \n";
+  BfsIterator< stGW, stGW::NodeMap<bool> > bfs_stgw(stgw);
+  bfs_stgw.pushAndSetReached(stgw.S_NODE);
+  while (!bfs_stgw.finished()) { 
+    std::cout << " " << stGW::OutEdgeIt(bfs_stgw) << "\n";
+    ++bfs_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.augmentOnShortestPath();
-  max_flow_test.augmentOnShortestPath();
+  while (max_flow_test.augmentOnShortestPath()) { }
 
   std::cout << max_flow_test.flowValue() << std::endl;