Lines Matching refs:adjncy
163 { printf("%5d", G->adjncy[i]); in printElimGraph()
172 { printf("%5d", G->adjncy[i]); in printElimGraph()
196 { v = G->adjncy[i]; in printElimGraph()
198 { printf("%5d", G->adjncy[i]); in printElimGraph()
231 PORD_INT *xadj, *adjncy, *vwght, *xadjGelim, *adjncyGelim, *vwghtGelim; in setupElimGraph() local
238 adjncy = G->adjncy; in setupElimGraph()
243 adjncyGelim = Gelim->G->adjncy; in setupElimGraph()
262 adjncyGelim[i] = adjncy[i]; in setupElimGraph()
282 deg += vwght[adjncy[i]]; in setupElimGraph()
303 { PORD_INT *xadj, *adjncy, *len; in crunchElimGraph() local
309 adjncy = Gelim->G->adjncy; in crunchElimGraph()
323 xadj[u] = adjncy[i]; /* if so, move first item to xadj[u] */ in crunchElimGraph()
324 adjncy[i] = -(u+1); /* u's adjacency list is headed by -(u+1) */ in crunchElimGraph()
335 { u = adjncy[isrc++]; in crunchElimGraph()
338 adjncy[idest] = xadj[u]; /* first item was stored in xadj[u] */ in crunchElimGraph()
341 adjncy[idest++] = adjncy[isrc++]; in crunchElimGraph()
359 PORD_INT *xadj, *adjncy, *vwght, *len, *elen, *parent, *degree, *score; in buildElement() local
365 adjncy = G->adjncy; in buildElement()
392 { v = adjncy[mesrcptr++]; in buildElement()
396 adjncy[medestptr++] = v; in buildElement()
410 e = adjncy[mesrcptr++]; /* merge boundary of element e with Lme */ in buildElement()
421 v = adjncy[p++]; in buildElement()
445 adjncy[G->nedges++] = adjncy[p]; in buildElement()
452 adjncy[medestptr++] = v; in buildElement()
486 { v = adjncy[mesrcptr++]; in buildElement()
496 { PORD_INT *xadj, *adjncy, *vwght, *len, *elen, *parent, *score; in updateAdjncy() local
501 adjncy = Gelim->G->adjncy; in updateAdjncy()
527 { e = adjncy[j]; in updateAdjncy()
536 { adjncy[jdest++] = adjncy[jfirstolde]; /* move 1st old e to end */ in updateAdjncy()
537 adjncy[jfirstolde++] = me; /* append me at the beg. */ in updateAdjncy()
543 { adjncy[jdest++] = e; in updateAdjncy()
554 { v = adjncy[j]; in updateAdjncy()
562 { adjncy[jdest++] = adjncy[jfirstv]; /* move 1st var. to end */ in updateAdjncy()
563 adjncy[jfirstv++] = adjncy[jfirstolde]; /* move 1st old e to end */ in updateAdjncy()
564 adjncy[jfirstolde++] = v; /* append v at the beg. */ in updateAdjncy()
569 adjncy[jdest++] = v; /* v is still a variable */ in updateAdjncy()
578 printf("%5d", adjncy[j]); in updateAdjncy()
581 printf("%5d", adjncy[j]); in updateAdjncy()
596 { v = adjncy[j]; in updateAdjncy()
598 adjncy[jdest++] = v; /* edge (u,v) not covered */ in updateAdjncy()
603 tmp[adjncy[jj]] = *pflag; /* of u */ in updateAdjncy()
607 if (tmp[adjncy[jj]] == *pflag) /* of v */ in updateAdjncy()
612 adjncy[jdest++] = v; in updateAdjncy()
621 printf("%5d", adjncy[j]); in updateAdjncy()
641 { PORD_INT *xadj, *adjncy, *vwght, *len, *elen, *parent, *score; in findIndNodes() local
645 adjncy = Gelim->G->adjncy; in findIndNodes()
677 chk += adjncy[jj]; in findIndNodes()
702 tmp[adjncy[j]] = *pflag; in findIndNodes()
713 if (tmp[adjncy[jj]] < *pflag) in findIndNodes()
762 { PORD_INT *xadj, *adjncy, *vwght, *len, *elen, *degree; in updateDegree() local
768 adjncy = Gelim->G->adjncy; in updateDegree()
790 { me = adjncy[xadj[u]]; /* in the neighborhood of u */ in updateDegree()
803 { v = adjncy[i]; /* e != me that are adjacent */ in updateDegree()
809 { e = adjncy[j]; in updateDegree()
820 { v = adjncy[i]; in updateDegree()
823 { e = adjncy[j]; in updateDegree()
835 { v = adjncy[i]; /* update the upper bound deg. */ in updateDegree()
844 { e = adjncy[j]; in updateDegree()
850 { w = adjncy[j]; in updateDegree()
871 { v = adjncy[i]; in updateDegree()
877 { e = adjncy[j]; in updateDegree()
891 { PORD_INT *xadj, *adjncy, *vwght, *len, *elen, *degree, *score; in updateScore() local
902 adjncy = Gelim->G->adjncy; in updateScore()
926 { me = adjncy[xadj[u]]; /* in the neighborhood of u */ in updateScore()
936 { v = adjncy[i]; /* update score of all principal */ in updateScore()