Changeset 220:7deda4d6a07a in lemon-0.x for src/work/jacint/prim.cc

Timestamp:

03/20/04 21:06:23 (20 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

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

Message:

* empty log message *

File:

• src/work/jacint/prim.cc (modified) (4 diffs)

src/work/jacint/prim.cc

@@ -2 +2 @@
 #include <fstream>
 
+#include <smart_graph.h>
 #include <list_graph.h>
 #include <dimacs.h>
@@ -13 +14 @@
 
 int main(int, char **) {
-  typedef ListGraph::Node Node;
+  typedef SmartGraph::Node Node;
 
-  ListGraph G;
+  SmartGraph G;
   Node s, t;
-  ListGraph::EdgeMap<int> cap(G);
+  SmartGraph::EdgeMap<int> cap(G);
   readDimacsMaxFlow(std::cin, G, s, t, cap);
 
@@ -23 +24 @@
   
   double pre_time=currTime();
-    Prim<ListGraph, int, FibHeap<ListGraph::Node, int, 
-    ListGraph::NodeMap<int> > > prim_test(G, cap);
+    Prim<SmartGraph, int, FibHeap<SmartGraph::Node, int, 
+    SmartGraph::NodeMap<int> > > prim_test(G, cap);
     prim_test.run();
   double post_time=currTime();
@@ -32 +33 @@
  
   pre_time=currTime();
-  Prim<ListGraph, int, BinHeap<ListGraph::Node, int, 
-    ListGraph::NodeMap<int> > > prim_test2(G, cap);
+  Prim<SmartGraph, int, BinHeap<SmartGraph::Node, int, 
+    SmartGraph::NodeMap<int> > > prim_test2(G, cap);
   prim_test2.run();
   post_time=currTime();