Index: src/work/marci/edmonds_karp_demo.cc
===================================================================
--- src/work/marci/edmonds_karp_demo.cc	(revision 139)
+++ src/work/marci/edmonds_karp_demo.cc	(revision 144)
@@ -55,10 +55,12 @@
   ListGraph::EdgeMap<int> flow(G); //0 flow
 
-  double pre_time=currTime();
+  Timer ts;
+  ts.reset();
+  //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<ListGraph>();
   int i=0;
   while (max_flow_test.augmentOnBlockingFlow<ListGraph>()) { ++i; }
-  double post_time=currTime();
+  //double post_time=currTime();
 
   //std::cout << "maximum flow: "<< std::endl;
@@ -67,5 +69,5 @@
   //}
   //std::cout<<std::endl;
-  std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
+  std::cout << "elapsed time: " << ts << std::endl;
   std::cout << "number of augmentation phases: " << i << std::endl; 
   std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;
@@ -76,10 +78,12 @@
   ListGraph::EdgeMap<int> flow(G); //0 flow
 
-  double pre_time=currTime();
+  Timer ts;
+  ts.reset();
+  //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<ListGraph>();
   int i=0;
   while (max_flow_test.augmentOnShortestPath()) { ++i; }
-  double post_time=currTime();
+  //double post_time=currTime();
 
   //std::cout << "maximum flow: "<< std::endl;
@@ -88,5 +92,5 @@
   //}
   //std::cout<<std::endl;
-  std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 
+  std::cout << "elapsed time: " << ts << std::endl;
   std::cout << "number of augmentation phases: " << i << std::endl; 
   std::cout << "flow value: "<< max_flow_test.flowValue() << std::endl;