1.1 --- a/src/work/bfs_iterator.hh	Thu Feb 26 16:07:40 2004 +0000
     1.2 +++ b/src/work/bfs_iterator.hh	Fri Feb 27 12:39:15 2004 +0000
     1.3 @@ -644,6 +644,7 @@
     1.4        //}
     1.5      }
     1.6      void pushAndSetReached(NodeIt s) { 
     1.7 +      actual_node=s;
     1.8        reached.set(s, true);
     1.9        dfs_stack.push(G.template first<OutEdgeIt>(s)); 
    1.10      }
    1.11 @@ -659,6 +660,7 @@
    1.12  	  reached.set(w, true);
    1.13  	  b_node_newly_reached=true;
    1.14  	} else {
    1.15 +	  actual_node=G.aNode(actual_edge);
    1.16  	  ++(dfs_stack.top());
    1.17  	  b_node_newly_reached=false;
    1.18  	}
    1.19 @@ -672,7 +674,7 @@
    1.20      operator OutEdgeIt () const { return actual_edge; }
    1.21      bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    1.22      bool isANodeExamined() const { return !(actual_edge.valid()); }
    1.23 -    NodeIt aNode() const { return actual_node; }
    1.24 +    NodeIt aNode() const { return actual_node; /*FIXME*/}
    1.25      NodeIt bNode() const { return G.bNode(actual_edge); }
    1.26      const ReachedMap& getReachedMap() const { return reached; }
    1.27      const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }