# HG changeset patch
# User marci
# Date 1077108344 0
# Node ID 3322fbf254d283f5c52bed047479b2ee5c6fb761
# Parent  90a35f45fa6add63cd9b14d87b19668760ee4b15
.

diff -r 90a35f45fa6a -r 3322fbf254d2 src/work/alpar/f_ed_ka.h
--- a/src/work/alpar/f_ed_ka.h	Tue Feb 17 16:59:52 2004 +0000
+++ b/src/work/alpar/f_ed_ka.h	Wed Feb 18 12:45:44 2004 +0000
@@ -16,8 +16,8 @@
   typename FlowMap::ValueType maxFlow(Graph &G,
 				      FlowMap &f,
 				      CapacityMap &c,
-				      typename Graph::EachNodeIt s,
-				      typename Graph::EachNodeIt t)
+				      typename Graph::NodeIt s,
+				      typename Graph::NodeIt t)
   { 
     typedef typename Graph::NodeIt NodeIt;
     typedef typename Graph::EachNodeIt EachNodeIt;
diff -r 90a35f45fa6a -r 3322fbf254d2 src/work/alpar/f_ed_ka_demo.cc
--- a/src/work/alpar/f_ed_ka_demo.cc	Tue Feb 17 16:59:52 2004 +0000
+++ b/src/work/alpar/f_ed_ka_demo.cc	Wed Feb 18 12:45:44 2004 +0000
@@ -12,11 +12,12 @@
 // read_dimacs_demo < dimacs_max_flow_file
 
 int main(int, char **) {
+  typedef ListGraph::NodeIt NodeIt;
   typedef ListGraph::EachNodeIt EachNodeIt;
   typedef ListGraph::EachEdgeIt EachEdgeIt;
 
   ListGraph G;
-  EachNodeIt s, t;
+  NodeIt s, t;
   ListGraph::EdgeMap<int> cap(G);
   readDimacsMaxFlow(std::cin, G, s, t, cap);