Lines Matching refs:Ci

125   StorageIndex* Ci = C.innerIndexPtr();  in minimum_degree_ordering()  local
149 if(Ci[p]==i) in minimum_degree_ordering()
200 Cp[j] = Ci[p]; /* save first entry of object */ in minimum_degree_ordering()
201 Ci[p] = amd_flip (j); /* first entry is now amd_flip(j) */ in minimum_degree_ordering()
206 if((j = amd_flip (Ci[p++])) >= 0) /* found object j */ in minimum_degree_ordering()
208 Ci[q] = Cp[j]; /* restore first entry of object */ in minimum_degree_ordering()
210 for(k3 = 0; k3 < len[j]-1; k3++) Ci[q++] = Ci[p++]; in minimum_degree_ordering()
232 e = Ci[p++]; /* search the nodes in e */ in minimum_degree_ordering()
238 i = Ci[pj++]; in minimum_degree_ordering()
242 Ci[pk2++] = i; /* place i in Lk */ in minimum_degree_ordering()
269 i = Ci[pk]; in minimum_degree_ordering()
275 e = Ci[p]; in minimum_degree_ordering()
290 i = Ci[pk]; /* consider node i in Lk */ in minimum_degree_ordering()
296 e = Ci[p]; in minimum_degree_ordering()
303 Ci[pn++] = e; /* keep e in Ei */ in minimum_degree_ordering()
318 j = Ci[p]; in minimum_degree_ordering()
321 Ci[pn++] = j; /* place j in node list of i */ in minimum_degree_ordering()
337 Ci[pn] = Ci[p3]; /* move first node to end */ in minimum_degree_ordering()
338 Ci[p3] = Ci[p1]; /* move 1st el. to end of Ei */ in minimum_degree_ordering()
339 Ci[p1] = k; /* add k as 1st element in of Ei */ in minimum_degree_ordering()
354 i = Ci[pk]; in minimum_degree_ordering()
363 for(p = Cp[i]+1; p <= Cp[i] + ln-1; p++) w[Ci[p]] = mark; in minimum_degree_ordering()
370 if(w[Ci[p]] != mark) ok = 0; /* compare i and j*/ in minimum_degree_ordering()
393 i = Ci[pk]; in minimum_degree_ordering()
404 Ci[p++] = i; /* place i in Lk */ in minimum_degree_ordering()