Lines Matching refs:BREDGE
31 #define BREDGE(e) ((Bredge_t*)grdtedge((e), Grbranching) )
51 PRINT(Fd,"root=%d, ", BREDGE(ed)->root ? (int)BREDGE(ed)->root->label : -1 );
52 PRINT(Fd,"wght=%d, ", (int)BREDGE(ed)->wght); PRINT(Fd,"wadj=%d\n", (int)BREDGE(ed)->wadj);
121 BREDGE(e)->edge = e; /* at start, representing self */
122 if((BREDGE(e)->wadj = BREDGE(e)->wght) > BREDGE(ec)->wadj )
157 { if(!emin || BREDGE(ec)->wadj < BREDGE(emin)->wadj )
178 { BREDGE(ec)->root = grfind(ec->head); /* save node union structure */
180 w = BREDGE(ec)->wadj - BREDGE(emin)->wadj;
182 { BREDGE(e)->wadj -= w;
202 if(BREDGE(e)->wadj <= 0 || grfind(e->head) == grfind(e->tail) )
204 if(!nc->iedge || BREDGE(nc->iedge)->wadj <= BREDGE(e)->wadj )
230 BREDGE(ec)->root->link = BREDGE(ec)->root;
233 en = BREDGE(en)->edge;
236 BREDGE(ec)->edge = en;
241 if(BREDGE(cl->emin)->edge == cl->emin)
242 BREDGE(cl->emin)->edge = NIL(Gredge_t*);
252 w += BREDGE(e)->wght;
264 BREDGE(e)->wght = w;
265 return BREDGE(e)->wght;