Home
last modified time | relevance | path

Searched refs:pk1 (Results 1 – 1 of 1) sorted by relevance

/external/eigen/Eigen/src/OrderingMethods/
DAmd.h100 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; in minimum_degree_ordering() local
220 pk1 = (elenk == 0) ? p : cnz; /* do in place if elen[k] == 0 */ in minimum_degree_ordering()
221 pk2 = pk1; in minimum_degree_ordering()
261 Cp[k] = pk1; /* element k is in Ci[pk1..pk2-1] */ in minimum_degree_ordering()
262 len[k] = pk2 - pk1; in minimum_degree_ordering()
267 for(pk = pk1; pk < pk2; pk++) /* scan 1: find |Le\Lk| */ in minimum_degree_ordering()
288 for(pk = pk1; pk < pk2; pk++) /* scan2: degree update */ in minimum_degree_ordering()
352 for(pk = pk1; pk < pk2; pk++) in minimum_degree_ordering()
391 for(p = pk1, pk = pk1; pk < pk2; pk++) /* finalize Lk */ in minimum_degree_ordering()
407 if((len[k] = p-pk1) == 0) /* length of adj list of element k*/ in minimum_degree_ordering()