Lines Matching refs:next
64 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack)
67 if(!head || !next || !post || !stack) return (-1); /* check inputs */
80 head[p] = next[i]; /* remove i from children of p */
116 Index* next = W + 2*(n+1);
136 next[i] = -1;
170 next[i] = head[d]; /* put node i in degree list d */
179 if(next[k] != -1) last[next[k]] = -1;
180 head[mindeg] = next[k]; /* remove k from degree list */
235 if(next[i] != -1) last[next[i]] = last[i];
238 next[last[i]] = next[i];
242 head[degree[i]] = next[i];
334 next[i] = hhead[h]; /* place i in hash bucket */
351 for(; i != -1 && next[i] != -1; i = next[i], mark++)
357 for(j = next[i]; j != -1; ) /* compare i with all j */
370 j = next[j]; /* delete j from hash bucket */
371 next[jlast] = j;
376 j = next[j];
391 next[i] = head[d]; /* put i back in degree list */
413 next[j] = head[Cp[j]]; /* place j in list of its parent */
421 next[e] = head[Cp[e]]; /* place e in list of its parent */
427 if(Cp[i] == -1) k = internal::cs_tdfs<Index>(i, k, head, next, perm.indices().data(), w);
