Home | History | Annotate | Download | only in OrderingMethods

Lines Matching defs:nv

114   StorageIndex* nv      = W +   (n+1);
137 nv[i] = 1; // node i is just one node
165 nv[i] = 0; /* absorb i into element n */
169 nv[n]++;
190 nvk = nv[k]; /* # of nodes k represents */
191 nel += nvk; /* nv[k] nodes of A eliminated */
218 nv[k] = -nvk; /* flag k as in Lk */
239 if((nvi = nv[i]) <= 0) continue; /* node i dead, or seen */
241 nv[i] = -nvi; /* negate nv[i] to denote i in Lk*/
271 nvi = -nv[i]; /* nv[i] was negated */
319 if((nvj = nv[j]) <= 0) continue; /* node j dead or in Lk */
327 nvi = -nv[i];
329 nvk += nvi; /* |k| += nv[i] */
331 nv[i] = 0;
355 if(nv[i] >= 0) continue; /* skip if i is dead */
375 nv[i] += nv[j];
376 nv[j] = 0;
394 if((nvi = -nv[i]) <= 0) continue;/* skip if i is dead */
395 nv[i] = nvi; /* restore nv[i] */
406 nv[k] = nvk; /* # nodes absorbed into k */
420 if(nv[j] > 0) continue; /* skip if j is an element */
426 if(nv[e] <= 0) continue; /* skip unless e is an element */