Index: src/work/marci/edmonds_karp_demo.cc
===================================================================
--- src/work/marci/edmonds_karp_demo.cc	(revision 73)
+++ src/work/marci/edmonds_karp_demo.cc	(revision 100)
@@ -20,4 +20,19 @@
   readDimacsMaxFlow(std::cin, G, s, t, cap);
 
+/*
+  double pre_time_copy=currTime();
+  ListGraph F;
+  ListGraph::NodeMap<NodeIt> G_to_F(G);
+  typedef ListGraph::EachNodeIt EachNodeIt;
+  for(EachNodeIt n=G.first<EachNodeIt>(); n.valid(); ++n) {
+    G_to_F.set(n, F.addNode());
+  }
+  for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
+    F.addEdge(G_to_F.get(G.tail(e)), G_to_F.get(G.head(e)));
+  }
+  double post_time_copy=currTime();
+  std::cout << "copy time: " << post_time_copy-pre_time_copy << " sec"<< std::endl; 
+*/
+
   std::cout << "edmonds karp demo..." << std::endl;
   ListGraph::EdgeMap<int> flow(G); //0 flow
@@ -25,4 +40,5 @@
   double pre_time=currTime();
   MaxFlow<ListGraph, int, ListGraph::EdgeMap<int>, ListGraph::EdgeMap<int> > max_flow_test(G, s, t, flow, cap);
+  max_flow_test.augmentWithBlockingFlow();
   max_flow_test.run();
   double post_time=currTime();
Index: src/work/marci/preflow_demo_jacint.cc
===================================================================
--- src/work/marci/preflow_demo_jacint.cc	(revision 89)
+++ src/work/marci/preflow_demo_jacint.cc	(revision 100)
@@ -28,5 +28,6 @@
   preflow_push_max_flow<ListGraph, int> max_flow_test(G, s, t, cap);
   max_flow_test.run();
-  ListGraph::NodeMap<bool> cut=max_flow_test.mincut();
+  ListGraph::NodeMap<bool> cut(G); 
+  max_flow_test.mincut(cut);
   int cut_value=0;
   for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
@@ -51,5 +52,6 @@
   preflow_push_hl<ListGraph, int> max_flow_test(G, s, t, cap);
   max_flow_test.run();
-  ListGraph::NodeMap<bool> cut=max_flow_test.mincut();
+  ListGraph::NodeMap<bool> cut(G);
+  max_flow_test.mincut(cut);
   int cut_value=0;
   for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {