1.1 --- a/src/lemon/smart_graph.h	Fri Jan 14 13:17:16 2005 +0000
     1.2 +++ b/src/lemon/smart_graph.h	Sun Jan 16 22:27:34 2005 +0000
     1.3 @@ -213,7 +213,7 @@
     1.4      Edge _findEdge(Node u,Node v, Edge prev = INVALID) 
     1.5      {
     1.6        int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out;
     1.7 -      while(e!=-1 && edges[e].source!=v.n) e = edges[e].next_out;
     1.8 +      while(e!=-1 && edges[e].target!=v.n) e = edges[e].next_out;
     1.9        prev.n=e;
    1.10        return prev;
    1.11      }