| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_counts.c | 7 CS_INT i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 CS_INT i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_counts.c | 7 CS_INT i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 CS_INT i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_counts.c | 7 csi i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 csi i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_counts.c | 7 CS_INT i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 CS_INT i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_counts.c | 7 csi i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 csi i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_counts.c | 7 csi i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 csi i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_counts.c | 7 CS_INT i, k, p, m = AT->n, n = AT->m, *ATp = AT->p, *ATi = AT->i ; in init_ata() local
12 for (k = n, p = ATp[i] ; p < ATp[i+1] ; p++) k = CS_MIN (k, w [ATi[p]]); in init_ata()
19 CS_INT i, j, k, n, m, J, s, p, q, jleaf, *ATp, *ATi, *maxfirst, *prevleaf, in cs_counts() local
37 ATp = AT->p ; ATi = AT->i ; in cs_counts()
46 for (p = ATp [J] ; p < ATp [J+1] ; p++) in cs_counts()
|
| /dports/math/igraph/igraph-0.9.5/vendor/cs/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_scc.c | 5 CS_INT n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_scc.c | 5 csi n, i, k, b, nb = 0, top, *xi, *pstack, *p, *r, *Ap, *ATp, *rcopy, *Blk ; in cs_scc() local
15 p = D->p ; r = D->r ; ATp = AT->p ; in cs_scc()
27 if (CS_MARKED (ATp, i)) continue ; /* skip node i if already ordered */ in cs_scc()
|