# HG changeset patch
# User marci
# Date 1081185940 0
# Node ID 6720705c9095177e804f3375ff56fcfdcf8cd625
# Parent  10d035c2e81c1df8a1c0893b2b2b81d7c91c55aa
.

diff -r 10d035c2e81c -r 6720705c9095 src/work/marci/edmonds_karp_demo.cc
--- a/src/work/marci/edmonds_karp_demo.cc	Mon Apr 05 17:10:25 2004 +0000
+++ b/src/work/marci/edmonds_karp_demo.cc	Mon Apr 05 17:25:40 2004 +0000
@@ -3,7 +3,7 @@
 #include <fstream>
 
 #include <list_graph.h>
-//#include <smart_graph.h>
+#include <smart_graph.h>
 #include <dimacs.h>
 #include <edmonds_karp.h>
 #include <time_measure.h>
@@ -39,8 +39,8 @@
 
   typedef ListGraph MutableGraph;
 
-  //typedef SmartGraph Graph;
-  typedef ListGraph Graph;
+  typedef SmartGraph Graph;
+  //typedef ListGraph Graph;
   typedef Graph::Node Node;
   typedef Graph::EdgeIt EdgeIt;
 
diff -r 10d035c2e81c -r 6720705c9095 src/work/marci/graph_wrapper.h
--- a/src/work/marci/graph_wrapper.h	Mon Apr 05 17:10:25 2004 +0000
+++ b/src/work/marci/graph_wrapper.h	Mon Apr 05 17:25:40 2004 +0000
@@ -714,7 +714,7 @@
       return e;
     }
 
-    template<typename I> I& next(I &i) const { return graph->next(i); }    
+    template<typename I> I& next(I &i) const { graph->next(i); return i; }    
 //    template<typename I> I getNext(const I& i) const { return gw.getNext(i); }
 
     template< typename It > It first() const { 
@@ -1004,7 +1004,7 @@
       return e;
     }
    
-    NodeIt& next(NodeIt& n) const { return graph->next(n); }
+    NodeIt& next(NodeIt& n) const { graph->next(n); return n; }
 
     OutEdgeIt& next(OutEdgeIt& e) const { 
       if (e.out_or_in) {