Actual source code: qmdupd.c
2: /* qmdupd.f -- translated by f2c (version 19931217).*/
4: #include <petscsys.h>
5: #include <petsc/private/matorderimpl.h>
7: /******************************************************************/
8: /*********** QMDUPD ..... QUOT MIN DEG UPDATE ************/
9: /******************************************************************/
10: /******************************************************************/
12: /* PURPOSE - THIS ROUTINE PERFORMS DEGREE UPDATE FOR A SET*/
13: /* OF NODES IN THE MINIMUM DEGREE ALGORITHM.*/
15: /* INPUT PARAMETERS -*/
16: /* (XADJ, ADJNCY) - THE ADJACENCY STRUCTURE.*/
17: /* (NLIST, LIST) - THE LIST OF NODES WHOSE DEGREE HAS TO*/
18: /* BE UPDATED.*/
20: /* UPDATED PARAMETERS -*/
21: /* DEG - THE DEGREE VECTOR.*/
22: /* QSIZE - SIZE OF INDISTINGUISHABLE SUPERNODES.*/
23: /* QLINK - LINKED LIST FOR INDISTINGUISHABLE NODES.*/
24: /* MARKER - USED TO MARK THOSE NODES IN REACH/NBRHD SETS.*/
26: /* WORKING PARAMETERS -*/
27: /* RCHSET - THE REACHABLE SET.*/
28: /* NBRHD - THE NEIGHBORHOOD SET.*/
30: /* PROGRAM SUBROUTINES -*/
31: /* QMDMRG.*/
32: /******************************************************************/
33: PetscErrorCode SPARSEPACKqmdupd(const PetscInt *xadj,const PetscInt *adjncy,const PetscInt *nlist,const PetscInt *list, PetscInt *deg,
34: PetscInt *qsize, PetscInt *qlink, PetscInt *marker, PetscInt *rchset, PetscInt *nbrhd)
35: {
36: /* System generated locals */
37: PetscInt i__1, i__2;
39: /* Local variables */
40: PetscInt inhd, irch, node, mark, j, inode, nabor, jstop, jstrt, il;
41: PetscInt nhdsze, rchsze, deg0, deg1;
43: /* FIND ALL ELIMINATED SUPERNODES THAT ARE ADJACENT*/
44: /* TO SOME NODES IN THE GIVEN LIST. PUT THEM INTO.*/
45: /* (NHDSZE, NBRHD). DEG0 CONTAINS THE NUMBER OF*/
46: /* NODES IN THE LIST.*/
49: /* Parameter adjustments */
50: --nbrhd;
51: --rchset;
52: --marker;
53: --qlink;
54: --qsize;
55: --deg;
56: --list;
57: --adjncy;
58: --xadj;
60: if (*nlist <= 0) return(0);
61: deg0 = 0;
62: nhdsze = 0;
63: i__1 = *nlist;
64: for (il = 1; il <= i__1; ++il) {
65: node = list[il];
66: deg0 += qsize[node];
67: jstrt = xadj[node];
68: jstop = xadj[node + 1] - 1;
69: i__2 = jstop;
70: for (j = jstrt; j <= i__2; ++j) {
71: nabor = adjncy[j];
72: if (marker[nabor] != 0 || deg[nabor] >= 0) goto L100;
73: marker[nabor] = -1;
74: ++nhdsze;
75: nbrhd[nhdsze] = nabor;
76: L100:
77: ;
78: }
79: }
80: /* MERGE INDISTINGUISHABLE NODES IN THE LIST BY*/
81: /* CALLING THE SUBROUTINE QMDMRG.*/
82: if (nhdsze > 0) {
83: SPARSEPACKqmdmrg(&xadj[1], &adjncy[1], °[1], &qsize[1], &qlink[1], &marker[1], °0, &nhdsze, &nbrhd[1], &rchset[1], &nbrhd[nhdsze + 1]);
84: }
85: /* FIND THE NEW DEGREES OF THE NODES THAT HAVE NOT BEEN*/
86: /* MERGED.*/
87: i__1 = *nlist;
88: for (il = 1; il <= i__1; ++il) {
89: node = list[il];
90: mark = marker[node];
91: if (mark > 1 || mark < 0) goto L600;
92: marker[node] = 2;
93: SPARSEPACKqmdrch(&node, &xadj[1], &adjncy[1], °[1], &marker[1], &rchsze, &rchset[1], &nhdsze, &nbrhd[1]);
94: deg1 = deg0;
95: if (rchsze <= 0) goto L400;
96: i__2 = rchsze;
97: for (irch = 1; irch <= i__2; ++irch) {
98: inode = rchset[irch];
99: deg1 += qsize[inode];
100: marker[inode] = 0;
101: }
102: L400:
103: deg[node] = deg1 - 1;
104: if (nhdsze <= 0) goto L600;
105: i__2 = nhdsze;
106: for (inhd = 1; inhd <= i__2; ++inhd) {
107: inode = nbrhd[inhd];
108: marker[inode] = 0;
109: }
110: L600:
111: ;
112: }
113: return(0);
114: }