Lines Matching refs:degree
89 * Approximate minimum degree ordering algorithm.
119 Index* degree = W + 5*(n+1);
134 head[i] = -1; // degree list i is empty
141 degree[i] = len[i]; // degree of node i
148 /* --- Initialize degree lists ------------------------------------------ */
151 d = degree[i];
170 next[i] = head[d]; /* put node i in degree list d */
177 /* --- Select node of minimum approximate degree -------------------- */
180 head[mindeg] = next[k]; /* remove k from degree list */
232 dk += nvi; /* degree[Lk] += size of node i */
236 if(last[i] != -1) /* remove i from degree list */
242 head[degree[i]] = next[i];
252 degree[k] = dk; /* external degree of k - |Lk\i| */
274 w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */
279 /* --- Degree update ------------------------------------------------ */
280 for(pk = pk1; pk < pk2; pk++) /* scan2: degree update */
312 d += nvj; /* degree(i) += |j| */
328 degree[i] = std::min<Index> (degree[i], d); /* update degree(i) */
339 degree[k] = dk; /* finalize |Lk| */
388 d = degree[i] + dk - nvi; /* compute external degree(i) */
391 next[i] = head[d]; /* put i back in degree list */
394 mindeg = std::min<Index> (mindeg, d); /* find new minimum degree */
395 degree[i] = d;
