Lines Matching refs:head
60 StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex *head, const StorageIndex *next, StorageIndex *post, StorageIndex *stack)
63 if(!head || !next || !post || !stack) return (-1); /* check inputs */
68 i = head[p]; /* i = youngest child of p */
76 head[p] = next[i]; /* remove i from children of p */
116 StorageIndex* head = W + 3*(n+1);
133 head[i] = -1; // degree list i is empty
173 if(head[d] != -1) last[head[d]] = i;
174 next[i] = head[d]; /* put node i in degree list d */
175 head[d] = i;
186 for(k = -1; mindeg < n && (k = head[mindeg]) == -1; mindeg++) {}
188 head[mindeg] = next[k]; /* remove k from degree list */
250 head[degree[i]] = next[i];
398 if(head[d] != -1) last[head[d]] = i;
399 next[i] = head[d]; /* put i back in degree list */
401 head[d] = i;
417 for(j = 0; j <= n; j++) head[j] = -1;
421 next[j] = head[Cp[j]]; /* place j in list of its parent */
422 head[Cp[j]] = j;
429 next[e] = head[Cp[e]]; /* place e in list of its parent */
430 head[Cp[e]] = e;
435 if(Cp[i] == -1) k = internal::cs_tdfs<StorageIndex>(i, k, head, next, perm.indices().data(), w);
