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