Searched defs:edge (Results 1 - 4 of 4) sorted by relevance

/ast/src/lib/libvgraph/
H A Dgrsearch.c16 Gredge_t* edge; /* edge being searched */ member in struct:_dfsnode_s
H A Dgraph.c52 static void edgefree(Dt_t* edges, Void_t* edge, Dtdisc_t* disc) argument
57 if(edge)
59 (*gr->disc->eventf)(gr, GR_EDGE|GR_CLOSING, edge, gr->disc ); local
61 for(dt = ((Gredge_t*)edge)->data; dt; dt = next)
66 free(edge);
120 Gredge_t edge, *ed, *e, *pe; local
128 if(!(edge.tail = tail) || !(edge.head = head) )
131 /* see if the edge exists */
132 edge
[all...]
H A Dgrbranching.c5 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 */ member in struct:_bredge_s
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 */
[all...]
/ast/src/cmd/codexlib/lzh/
H A Dlzh.c88 short edge[TREESIZE]; member in struct:State_s
440 if (state->edge[b = state->block[i]] == i)
481 state->edge[b = state->block[i] = state->stock[state->avail++]] = i;
496 if ((q = state->edge[b]) != p)
521 state->edge[b]++;
525 state->edge[state->block[p] = state->stock[state->avail++]] = p;
580 state->edge[state->block[ROOT_P]]++;
583 state->edge[state->block[q] = state->stock[state->avail++]]
685 state->edge[1] = state->n_max - 1;
693 state->edge[stat
[all...]

Completed in 14 milliseconds