1.1 --- a/src/work/alpar/f_ed_ka.h	Tue Feb 17 16:59:52 2004 +0000
     1.2 +++ b/src/work/alpar/f_ed_ka.h	Wed Feb 18 12:45:44 2004 +0000
     1.3 @@ -16,8 +16,8 @@
     1.4    typename FlowMap::ValueType maxFlow(Graph &G,
     1.5  				      FlowMap &f,
     1.6  				      CapacityMap &c,
     1.7 -				      typename Graph::EachNodeIt s,
     1.8 -				      typename Graph::EachNodeIt t)
     1.9 +				      typename Graph::NodeIt s,
    1.10 +				      typename Graph::NodeIt t)
    1.11    { 
    1.12      typedef typename Graph::NodeIt NodeIt;
    1.13      typedef typename Graph::EachNodeIt EachNodeIt;

     2.1 --- a/src/work/alpar/f_ed_ka_demo.cc	Tue Feb 17 16:59:52 2004 +0000
     2.2 +++ b/src/work/alpar/f_ed_ka_demo.cc	Wed Feb 18 12:45:44 2004 +0000
     2.3 @@ -12,11 +12,12 @@
     2.4  // read_dimacs_demo < dimacs_max_flow_file
     2.5  
     2.6  int main(int, char **) {
     2.7 +  typedef ListGraph::NodeIt NodeIt;
     2.8    typedef ListGraph::EachNodeIt EachNodeIt;
     2.9    typedef ListGraph::EachEdgeIt EachEdgeIt;
    2.10  
    2.11    ListGraph G;
    2.12 -  EachNodeIt s, t;
    2.13 +  NodeIt s, t;
    2.14    ListGraph::EdgeMap<int> cap(G);
    2.15    readDimacsMaxFlow(std::cin, G, s, t, cap);
    2.16