117   StorageIndex* elen    = W + 4*(n+1);  in minimum_degree_ordering()  local
139     elen[i]   = 0;                      // Ek of node i is empty  in minimum_degree_ordering()
158       elen[i] = -2;                 /* element i is dead */  in minimum_degree_ordering()
166       elen[i] = -1;                 /* node i is dead */  in minimum_degree_ordering()
179   elen[n] = -2;                         /* n is a dead element */  in minimum_degree_ordering()
189     elenk = elen[k];                  /* elenk = |Ek| */  in minimum_degree_ordering()
263     elen[k] = -2;                     /* k is now an element */  in minimum_degree_ordering()
270       if((eln = elen[i]) <= 0) continue;/* skip if elen[i] empty */  in minimum_degree_ordering()
292       p2 = p1 + elen[i] - 1;  in minimum_degree_ordering()
313       elen[i] = pn - p1 + 1;        /* elen[i] = |Ei| */  in minimum_degree_ordering()
332         elen[i] = -1;             /* node i is dead */  in minimum_degree_ordering()
362         eln = elen[i];  in minimum_degree_ordering()
367           ok = (len[j] == ln) && (elen[j] == eln);  in minimum_degree_ordering()
377             elen[j] = -1;         /* node j is dead */  in minimum_degree_ordering()