32
32
if (i > j) continue ; /* skip lower triangular part of A*/
33
33
i2 = pinv ? pinv [i] : i ; /* row i of A is row i2 of C */
34
34
Ci [q = w [CS_MAX (i2, j2)]++] = CS_MIN (i2, j2) ;
38
38
return (cs_done (C, w, NULL, 1)) ; /* success; free workspace, return C */