Searched refs:Gredge_t (Results 1 - 6 of 6) sorted by relevance

/ast/src/lib/libvgraph/
H A Dgrsearch.c16 Gredge_t* edge; /* edge being searched */
H A Dgrfold.c29 Gredge_t *ed, *enext, *oedge, *iedge;
41 oedge = iedge = NIL(Gredge_t*);
43 { ed = nd->oedge; nd->oedge = NIL(Gredge_t*);
50 ed = nd->iedge; nd->iedge = NIL(Gredge_t*);
H A Dvgraph.h7 typedef struct _gredge_s Gredge_t; typedef in typeref:struct:_gredge_s
20 Gredge_t* oedge; /* list of outgoing edges */
21 Gredge_t* iedge; /* list of incoming edges */
22 Gredge_t* elist; /* edge list being traversed */
38 Gredge_t* onext; /* link for node->oedge */
39 Gredge_t* inext; /* link for node->iedge */
41 Gredge_t* link; /* for temporary link list */
62 ssize_t edgesz; /* size to allocate Gredge_t */
107 #define _Gredge(oo) ((Gredge_t*)(oo))
121 extern Gredge_t* gredg
[all...]
H A Dgrbranching.c12 { Gredge_t* cycl; /* the cycle of strong components */
13 Gredge_t* emin; /* the minimum weight edge of cycle */
14 Gredge_t* entr; /* the edge that came in to the cycle */
27 Gredge_t* edge; /* branching edge that this represents */
43 static int predge(Gredge_t* ed)
55 static int prlink(Gredge_t* e)
60 static int prinext(Gredge_t* e)
65 static int pronext(Gredge_t* e)
87 Gredge_t *e;
95 Gredge_t *e
[all...]
H A Dgraph.c40 Gredge_t *e1 = (Gredge_t*)one;
41 Gredge_t *e2 = (Gredge_t*)two;
61 for(dt = ((Gredge_t*)edge)->data; dt; dt = next)
74 Gredge_t *e, *enext;
118 Gredge_t* gredge(Graph_t* gr, Grnode_t* tail, Grnode_t* head, Void_t* label, int type)
120 Gredge_t edge, *ed, *e, *pe;
129 return NIL(Gredge_t*);
137 { for(pe = NIL(Gredge_t*),
[all...]
/ast/src/lib/libvcodex/
H A Dvcsfxsort.c368 Gredge_t *e;
487 Gredge_t *e;

Completed in 10 milliseconds