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