1.1 --- a/src/hugo/max_flow.h	Tue Aug 24 09:50:33 2004 +0000
     1.2 +++ b/src/hugo/max_flow.h	Wed Aug 25 18:55:57 2004 +0000
     1.3 @@ -838,7 +838,8 @@
     1.4  
     1.5  	    //putting the active nodes into the stack
     1.6  	    int lev=level[w];
     1.7 -	    if ( exc > 0 && lev < n && w != t ) 
     1.8 +	    if ( exc > 0 && lev < n && Node(w) != t ) 
     1.9 +///\bug	    if ( exc > 0 && lev < n && w != t ) tempararily for working with wrappers. in hugo 0.2 it will work. Amugy mukodik sage_graph-fal, de smart_graph-fal nem, azt hozzatennem.
    1.10  	      {
    1.11  		next.set(w,first[lev]);
    1.12  		first[lev]=w;
    1.13 @@ -855,7 +856,7 @@
    1.14  		 NNMap& right, int& b, int& k, bool what_heur )
    1.15      {
    1.16  
    1.17 -      Num lev=level[w];
    1.18 +      int lev=level[w];
    1.19  
    1.20        Node right_n=right[w];
    1.21        Node left_n=left[w];