Changeset 196:8a9b9360463e in lemon-0.x for src/work/marci/max_bipartite_matching_demo.cc

Timestamp:

03/17/04 17:10:33 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

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

src/work/marci/max_bipartite_matching_demo.cc

@@ -5 +5 @@
 #include <cstdlib>
 
-#include <LEDA/graph.h>
-#include <leda_graph_wrapper.h>
+//#include <LEDA/graph.h>
+//#include <leda_graph_wrapper.h>
+#include <list_graph.h>
 #include <dimacs.h>
 #include <time_measure.h>
@@ -39 +40 @@
 
 int main() {
-  leda::graph g;
-  typedef LedaGraphWrapper<leda::graph> Graph;
-  Graph G(g);
+//   leda::graph g;
+//   typedef LedaGraphWrapper<leda::graph> Graph;
+//   Graph G(g);
+  typedef ListGraph Graph;
+  Graph G;
 
   typedef Graph::Node Node;
@@ -62 +65 @@
     t_nodes.push_back(G.addNode());
   }
-//   random_init();
-//   for(int i=0; i<6; ++i) {
-//     G.addEdge(s_nodes[random(4)], t_nodes[random(4)]);
-//   }
+  random_init();
+  for(int i=0; i<6; ++i) {
+    G.addEdge(s_nodes[random(4)], t_nodes[random(4)]);
+  }
   
-  G.addEdge(s_nodes[2], t_nodes[4-4]);
-  G.addEdge(s_nodes[2], t_nodes[7-4]);
-  G.addEdge(s_nodes[2], t_nodes[4-4]);
-  G.addEdge(s_nodes[3], t_nodes[6-4]);
-  G.addEdge(s_nodes[3], t_nodes[5-4]);
-  G.addEdge(s_nodes[3], t_nodes[5-4]);
+//   G.addEdge(s_nodes[2], t_nodes[4-4]);
+//   G.addEdge(s_nodes[2], t_nodes[7-4]);
+//   G.addEdge(s_nodes[2], t_nodes[4-4]);
+//   G.addEdge(s_nodes[3], t_nodes[6-4]);
+//   G.addEdge(s_nodes[3], t_nodes[5-4]);
+//   G.addEdge(s_nodes[3], t_nodes[5-4]);