/src/igraph/vendor/cs/cs_reach.c
Line | Count | Source (jump to first uncovered line) |
1 | | #include "cs.h" |
2 | | /* xi [top...n-1] = nodes reachable from graph of G*P' via nodes in B(:,k). |
3 | | * xi [n...2n-1] used as workspace */ |
4 | | CS_INT cs_reach (cs *G, const cs *B, CS_INT k, CS_INT *xi, const CS_INT *pinv) |
5 | 0 | { |
6 | 0 | CS_INT p, n, top, *Bp, *Bi, *Gp ; |
7 | 0 | if (!CS_CSC (G) || !CS_CSC (B) || !xi) return (-1) ; /* check inputs */ |
8 | 0 | n = G->n ; Bp = B->p ; Bi = B->i ; Gp = G->p ; |
9 | 0 | top = n ; |
10 | 0 | for (p = Bp [k] ; p < Bp [k+1] ; p++) |
11 | 0 | { |
12 | 0 | if (!CS_MARKED (Gp, Bi [p])) /* start a dfs at unmarked node i */ |
13 | 0 | { |
14 | 0 | top = cs_dfs (Bi [p], G, top, xi, xi+n, pinv) ; |
15 | 0 | } |
16 | 0 | } |
17 | 0 | for (p = top ; p < n ; p++) CS_MARK (Gp, xi [p]) ; /* restore G */ |
18 | 0 | return (top) ; |
19 | 0 | } |