121   Index* Cp = C.outerIndexPtr();  in minimum_degree_ordering()  local
124     len[k] = Cp[k+1] - Cp[k];  in minimum_degree_ordering()
141   Cp[n] = -1;                           /* n is a root of assembly tree */  in minimum_degree_ordering()
152       Cp[i] = -1;                   /* i is a root of assembly tree */  in minimum_degree_ordering()
160       Cp[i] = amd_flip (n);  in minimum_degree_ordering()
186         if((p = Cp[j]) >= 0)      /* j is a live node or element */  in minimum_degree_ordering()
188           Cp[j] = Ci[p];          /* save first entry of object */  in minimum_degree_ordering()
196           Ci[q] = Cp[j];       /* restore first entry of object */  in minimum_degree_ordering()
197           Cp[j] = q++;          /* new pointer to object j */  in minimum_degree_ordering()
207     p = Cp[k];  in minimum_degree_ordering()
221         pj = Cp[e];  in minimum_degree_ordering()
243         Cp[e] = amd_flip (k);      /* absorb e into k */  in minimum_degree_ordering()
249     Cp[k] = pk1;                      /* element k is in Ci[pk1..pk2-1] */  in minimum_degree_ordering()
261       for(p = Cp[i]; p <= Cp[i] + eln - 1; p++)  /* scan Ei */  in minimum_degree_ordering()
279       p1 = Cp[i];  in minimum_degree_ordering()
296             Cp[e] = amd_flip (k);  /* aggressive absorb. e->k */  in minimum_degree_ordering()
314         Cp[i] = amd_flip (k);      /* absorb i into k */  in minimum_degree_ordering()
351         for(p = Cp[i]+1; p <= Cp[i] + ln-1; p++) w[Ci[p]] = mark;  in minimum_degree_ordering()
356           for(p = Cp[j] + 1; ok && p <= Cp[j] + ln - 1; p++)  in minimum_degree_ordering()
362             Cp[j] = amd_flip (i);  /* absorb j into i */  in minimum_degree_ordering()
397       Cp[k] = -1;                   /* k is a root of the tree */  in minimum_degree_ordering()
404   for(i = 0; i < n; i++) Cp[i] = amd_flip (Cp[i]);/* fix assembly tree */  in minimum_degree_ordering()
409     next[j] = head[Cp[j]];          /* place j in list of its parent */  in minimum_degree_ordering()
410     head[Cp[j]] = j;  in minimum_degree_ordering()
415     if(Cp[e] != -1)  in minimum_degree_ordering()
417       next[e] = head[Cp[e]];      /* place e in list of its parent */  in minimum_degree_ordering()
418       head[Cp[e]] = e;  in minimum_degree_ordering()
423     if(Cp[i] == -1) k = internal::cs_tdfs<Index>(i, k, head, next, perm.indices().data(), w);  in minimum_degree_ordering()