1.1 --- a/lemon/bipartite_matching.h	Tue Oct 02 14:20:04 2007 +0000
     1.2 +++ b/lemon/bipartite_matching.h	Tue Oct 09 09:36:54 2007 +0000
     1.3 @@ -115,7 +115,7 @@
     1.4            if (_rmatching[_graph->bNode(jt)] == INVALID) {
     1.5              _matching.set(it, jt);
     1.6  	    _rmatching.set(_graph->bNode(jt), jt);
     1.7 -	    _reached.set(it, -1);
     1.8 +	    _reached.set(_graph->bNode(jt), -1);
     1.9              ++_size;
    1.10              break;
    1.11            }