Index: src/test/preflow_test.cc
===================================================================
--- src/test/preflow_test.cc	(revision 833)
+++ src/test/preflow_test.cc	(revision 842)
@@ -58,4 +58,5 @@
   typedef SmartGraph Graph;
   
+  typedef Graph::Node Node;
   typedef Graph::NodeIt NodeIt;
   typedef Graph::EdgeIt EdgeIt;
@@ -69,5 +70,5 @@
   
   Graph G;
-  NodeIt s, t;
+  Node s, t;
   CapMap cap(G);
   readDimacs(file, G, cap, s, t);
@@ -101,5 +102,10 @@
   for(EdgeIt e(G); e!=INVALID; ++e) cap[e]=2*cap[e]; 
   preflow_test.setCap(cap);  
-  preflow_test.setTarget(++t); //the max flow value remains 2*flow_value
+
+  NodeIt tmp_node(G,t);
+  ++tmp_node;
+  t=tmp_node;
+  
+  preflow_test.setTarget(t); //the max flow value remains 2*flow_value
   //warning: ++t must be a valid node. In preflow_graph, it is.