Changeset 194:a1680b3c516c in lemon-0.x for src/work/marci/max_bipartite_matching_demo.cc

Timestamp:

03/17/04 16:09:48 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

• src/work/marci/max_bipartite_matching_demo.cc (modified) (3 diffs)

src/work/marci/max_bipartite_matching_demo.cc

@@ -50 +50 @@
   typedef Graph::InEdgeIt InEdgeIt;
 
-  Node s, t;
+  //Node s, t;
   //Graph::EdgeMap<int> cap(G);
   //readDimacsMaxFlow(std::cin, G, s, t, cap);
@@ -66 +66 @@
     G.addEdge(s_nodes[random(20)], t_nodes[random(20)]);
   }
-  Graph::NodeMap<bool> s_map; //false
-  Graph::NodeMap<bool> t_map; //false
+  Graph::NodeMap<bool> s_map(G); //false
+  Graph::NodeMap<bool> t_map(G); //false
   
   for(int i=0; i<20; ++i) {
@@ -77 +77 @@
     std::cout << "on-the-fly max bipartite matching demo on wrapped leda graph..." << std::endl;
     Graph::EdgeMap<int> flow(G); //0 flow
-    Graph::EdgeMap<int> capacity(G, 1);
+    Graph::EdgeMap<int> cap(G, 1);
 
     Timer ts;