96       k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi,  in minimum_degree_ordering()  local
227         if((nvi = nv[i]) <= 0) continue; /* node i dead, or seen */  in minimum_degree_ordering()
228         dk += nvi;                 /* degree[Lk] += size of node i */  in minimum_degree_ordering()
229         nv[i] = -nvi;             /* negate nv[i] to denote i in Lk*/  in minimum_degree_ordering()
259       nvi = -nv[i];                      /* nv[i] was negated */  in minimum_degree_ordering()
260       wnvi = mark - nvi;  in minimum_degree_ordering()
266           w[e] -= nvi;          /* decrement |Le\Lk| */  in minimum_degree_ordering()
315         nvi = -nv[i];  in minimum_degree_ordering()
316         dk -= nvi;                 /* |Lk| -= |i| */  in minimum_degree_ordering()
317         nvk += nvi;                /* |k| += nv[i] */  in minimum_degree_ordering()
318         nel += nvi;  in minimum_degree_ordering()
382       if((nvi = -nv[i]) <= 0) continue;/* skip if i is dead */  in minimum_degree_ordering()
383       nv[i] = nvi;                      /* restore nv[i] */  in minimum_degree_ordering()
384       d = degree[i] + dk - nvi;         /* compute external degree(i) */  in minimum_degree_ordering()
385       d = std::min<Index> (d, n - nel - nvi);  in minimum_degree_ordering()