1.1 --- a/lemon/list_graph.h	Tue Jul 22 11:29:57 2008 +0000
     1.2 +++ b/lemon/list_graph.h	Fri Sep 19 15:14:41 2008 +0000
     1.3 @@ -118,7 +118,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        e.id = (n == -1) ? -1 : nodes[n].first_in;
    1.10      }
    1.11  
    1.12 @@ -128,8 +128,8 @@
    1.13        } else {
    1.14  	int n;
    1.15  	for(n = nodes[edges[edge.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  	edge.id = (n == -1) ? -1 : nodes[n].first_in;
    1.21        }      
    1.22      }