169         int e0 = -1, ei = 0, ej = 0, min_weight, weight;  in icvGCMaxFlow()  local
179                 for( ei = v->first; ei != 0; ei = edges[ei].next )  in icvGCMaxFlow()
181                     if( edges[ei^vt].weight == 0 )  in icvGCMaxFlow()
183                     u = edges[ei].dst;  in icvGCMaxFlow()
187                         u->parent = ei ^ 1;  in icvGCMaxFlow()
200                         e0 = ei ^ vt;  in icvGCMaxFlow()
207                         u->parent = ei ^ 1;  in icvGCMaxFlow()
229             for( v = edges[e0^k].dst;; v = edges[ei].dst )  in icvGCMaxFlow()
231                 if( (ei = v->parent) < 0 )  in icvGCMaxFlow()
233                 weight = edges[ei^k].weight;  in icvGCMaxFlow()
250             for( v = edges[e0^k].dst;; v = edges[ei].dst )  in icvGCMaxFlow()
252                 if( (ei = v->parent) < 0 )  in icvGCMaxFlow()
254                 edges[ei^(k^1)].weight += min_weight;  in icvGCMaxFlow()
255                 if( (edges[ei^k].weight -= min_weight) == 0 )  in icvGCMaxFlow()
283             for( ei = v->first; ei != 0; ei = edges[ei].next )  in icvGCMaxFlow()
285                 if( edges[ei^(vt^1)].weight == 0 )  in icvGCMaxFlow()
287                 u = edges[ei].dst;  in icvGCMaxFlow()
320                         e0 = ei;  in icvGCMaxFlow()
322                     for( u = edges[ei].dst; u->ts != curr_ts; u = edges[u->parent].dst )  in icvGCMaxFlow()
339             for( ei = v->first; ei != 0; ei = edges[ei].next )  in icvGCMaxFlow()
341                 u = edges[ei].dst;  in icvGCMaxFlow()
345                 if( edges[ei^(vt^1)].weight && !u->next )  in icvGCMaxFlow()