Lines Matching refs:degree
86 * Approximate minimum degree ordering algorithm.
115 Index* degree = W + 5*(n+1);
130 head[i] = -1; // degree list i is empty
137 degree[i] = len[i]; // degree of node i
144 /* --- Initialize degree lists ------------------------------------------ */
147 d = degree[i];
166 next[i] = head[d]; /* put node i in degree list d */
173 /* --- Select node of minimum approximate degree -------------------- */
176 head[mindeg] = next[k]; /* remove k from degree list */
228 dk += nvi; /* degree[Lk] += size of node i */
232 if(last[i] != -1) /* remove i from degree list */
238 head[degree[i]] = next[i];
248 degree[k] = dk; /* external degree of k - |Lk\i| */
270 w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */
275 /* --- Degree update ------------------------------------------------ */
276 for(pk = pk1; pk < pk2; pk++) /* scan2: degree update */
308 d += nvj; /* degree(i) += |j| */
324 degree[i] = std::min<Index> (degree[i], d); /* update degree(i) */
335 degree[k] = dk; /* finalize |Lk| */
384 d = degree[i] + dk - nvi; /* compute external degree(i) */
387 next[i] = head[d]; /* put i back in degree list */
390 mindeg = std::min<Index> (mindeg, d); /* find new minimum degree */
391 degree[i] = d;
