1.1 --- a/src/work/alpar/f_ed_ka.h	Tue Feb 17 14:04:46 2004 +0000
     1.2 +++ b/src/work/alpar/f_ed_ka.h	Tue Feb 17 16:59:52 2004 +0000
     1.3 @@ -40,7 +40,7 @@
     1.4                                               //3: it is node s
     1.5      typename Graph::NodeMap<EdgeIt> tree(G);
     1.6      
     1.7 -    EachNodeIt gn;  //FIXME: it might be too global for some people...
     1.8 +    NodeIt gn;  //FIXME: it might be too global for some people...
     1.9      
    1.10    augment:
    1.11      

     2.1 --- a/src/work/edmonds_karp.hh	Tue Feb 17 14:04:46 2004 +0000
     2.2 +++ b/src/work/edmonds_karp.hh	Tue Feb 17 16:59:52 2004 +0000
     2.3 @@ -242,12 +242,14 @@
     2.4  
     2.5    template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
     2.6    class ResGraph3 {
     2.7 +public:
     2.8      typedef typename Graph::NodeIt NodeIt;
     2.9      typedef typename Graph::EachNodeIt EachNodeIt;
    2.10      //typedef typename Graph::SymEdgeIt OldSymEdgeIt;
    2.11      typedef typename Graph::OutEdgeIt OldOutEdgeIt;
    2.12      typedef typename Graph::InEdgeIt OldInEdgeIt;
    2.13      
    2.14 +private:
    2.15      const Graph& G;
    2.16      FlowMap& flow;
    2.17      const CapacityMap& capacity;

     3.1 --- a/src/work/list_graph.hh	Tue Feb 17 14:04:46 2004 +0000
     3.2 +++ b/src/work/list_graph.hh	Tue Feb 17 16:59:52 2004 +0000
     3.3 @@ -389,8 +389,8 @@
     3.4        EachNodeIt(node_item* v) : NodeIt(v) { }
     3.5        EachNodeIt& operator++() { node=node->_next_node; return *this; }
     3.6        //FIXME::
     3.7 -      EachNodeIt& operator=(const NodeIt& e)
     3.8 -      { node=e.node; return *this; }
     3.9 +      //      EachNodeIt& operator=(const NodeIt& e)
    3.10 +      //      { node=e.node; return *this; }
    3.11      };
    3.12  
    3.13      class EdgeIt {