Lines Matching defs:edge
5 directed graph with edge weights. The algorithm alters the edge
13 Gredge_t* emin; /* the minimum weight edge of cycle */
14 Gredge_t* entr; /* the edge that came in to the cycle */
24 ssize_t wght; /* the original edge weight */
27 Gredge_t* edge; /* branching edge that this represents */
46 { PRINT(Fd,"Null edge\n",0);
121 BREDGE(e)->edge = e; /* at start, representing self */
155 /* potential cycle, check that out and also compute min edge */
199 /* make new edge list, keep heaviest edge in front */
233 en = BREDGE(en)->edge;
236 BREDGE(ec)->edge = en;
239 if(!en) /* isolated cycle, remove minimum edge */
241 if(BREDGE(cl->emin)->edge == cl->emin)
242 BREDGE(cl->emin)->edge = NIL(Gredge_t*);