1.1 --- a/lemon/list_graph.h	Fri Jun 20 11:09:30 2008 +0100
     1.2 +++ b/lemon/list_graph.h	Thu Mar 27 16:27:23 2008 +0100
     1.3 @@ -115,7 +115,7 @@
     1.4        int n;
     1.5        for(n = first_node; 
     1.6  	  n!=-1 && nodes[n].first_in == -1; 
     1.7 -	  n = nodes[n].next);
     1.8 +	  n = nodes[n].next) {}
     1.9        arc.id = (n == -1) ? -1 : nodes[n].first_in;
    1.10      }
    1.11  
    1.12 @@ -125,8 +125,8 @@
    1.13        } else {
    1.14  	int n;
    1.15  	for(n = nodes[arcs[arc.id].target].next;
    1.16 -	  n!=-1 && nodes[n].first_in == -1; 
    1.17 -	  n = nodes[n].next);
    1.18 +	    n!=-1 && nodes[n].first_in == -1; 
    1.19 +	    n = nodes[n].next) {}
    1.20  	arc.id = (n == -1) ? -1 : nodes[n].first_in;
    1.21        }      
    1.22      }