Changeset 220:7deda4d6a07a in lemon-0.x for src/work/jacint/preflow.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/preflow.cc (modified) (4 diffs)

src/work/jacint/preflow.cc

@@ -2 +2 @@
 #include <fstream>
 
+#include <smart_graph.h>
 #include <list_graph.h>
 #include <dimacs.h>
@@ -12 +13 @@
 // read_dimacs_demo < dimacs_max_flow_file
 int main(int, char **) {
-  typedef ListGraph::Node Node;
-  typedef ListGraph::EdgeIt EdgeIt;
+  typedef SmartGraph::Node Node;
+  typedef SmartGraph::EdgeIt EdgeIt;
 
-  ListGraph G;
+  SmartGraph G;
   Node s, t;
-  ListGraph::EdgeMap<int> cap(G);
+  SmartGraph::EdgeMap<int> cap(G);
   readDimacsMaxFlow(std::cin, G, s, t, cap);
 
@@ -25 +26 @@
 
   for ( int i=1; i!=11; ++i ) {
-    ListGraph::EdgeMap<int> flow(G);
+    SmartGraph::EdgeMap<int> flow(G);
     double pre_time=currTime();
-    Preflow<ListGraph, int> max_flow_test(G, s, t, cap, flow);
+    Preflow<SmartGraph, int> max_flow_test(G, s, t, cap, flow);
     max_flow_test.run();
     double post_time=currTime();
@@ -33 +34 @@
   }
 
-  ListGraph::EdgeMap<int> flow(G);
-  Preflow<ListGraph, int> max_flow_test(G, s, t, cap, flow);
+  SmartGraph::EdgeMap<int> flow(G);
+  Preflow<SmartGraph, int> max_flow_test(G, s, t, cap, flow);
   max_flow_test.run();
   
-  ListGraph::NodeMap<bool> cut(G);
+  SmartGraph::NodeMap<bool> cut(G);
   max_flow_test.minCut(cut); 
   int min_cut_value=0;
   EdgeIt e;
   for(G.first(e); G.valid(e); G.next(e)) {
-    if (cut.get(G.tail(e)) && !cut.get(G.head(e))) min_cut_value+=cap.get(e);
+    if (cut[G.tail(e)] && !cut[G.head(e)]) min_cut_value+=cap[e];
   }
 
-  ListGraph::NodeMap<bool> cut1(G);
+  SmartGraph::NodeMap<bool> cut1(G);
   max_flow_test.minMinCut(cut1); 
   int min_min_cut_value=0;
   for(G.first(e); G.valid(e); G.next(e)) {
-    if (cut.get(G.tail(e)) && !cut.get(G.head(e))) 
-      min_min_cut_value+=cap.get(e);
+    if (cut[G.tail(e)] && !cut[G.head(e)]) 
+      min_min_cut_value+=cap[e];
   }
 
-  ListGraph::NodeMap<bool> cut2(G);
+  SmartGraph::NodeMap<bool> cut2(G);
   max_flow_test.maxMinCut(cut2); 
   int max_min_cut_value=0;
   for(G.first(e); G.valid(e); G.next(e)) {
-    if (cut2.get(G.tail(e)) && !cut2.get(G.head(e))) 
-      max_min_cut_value+=cap.get(e);
+    if (cut2[G.tail(e)] && !cut2[G.head(e)]) 
+      max_min_cut_value+=cap[e];
       }