Searched refs:inext (Results 1 - 4 of 4) sorted by relevance

/ast/src/lib/libvgraph/
H A Dgrbranching.c61 { for(; e; e = e->inext)
100 for(ed = nd->iedge; ed; ed = ed->inext)
119 for(ep = en = NIL(Gredge_t*), ec = e = n->iedge; e; en = e, e = e->inext )
126 { ep->inext = ec->inext; ec->inext = n->iedge; n->iedge = ec; }
181 for(ep = NIL(Gredge_t*), e = grfind(ec->head)->iedge; e; e = e->inext)
183 if(!e->inext) /* last of list */
186 ep->inext = en; en = grfind(ec->head)->iedge; /* catenate lists */
201 { en = e->inext;
[all...]
H A Dgrfold.c52 { enext = ed->inext;
54 { ed->inext = iedge; iedge = ed; }
H A Dgraph.c145 for(pe = NIL(Gredge_t*), e = ed->head->iedge; e; pe = e, e = e->inext)
148 pe->inext = e->inext;
149 else ed->head->iedge->inext = e->inext;
170 ed->inext = edge.head->iedge; edge.head->iedge = ed;
217 ed->inext = ed->head->iedge; ed->head->iedge = ed;
H A Dvgraph.h39 Gredge_t* inext; /* link for node->iedge */ member in struct:_gredge_s
148 #define grnextedge(n,e) ((n)->elist == (n)->iedge ? (e)-> inext : \

Completed in 18 milliseconds