interface SparseMatrixData {
    _size: number[];
    _values?: unknown[];
    _index: number[];
    _ptr: number[];
}
/**
 * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
 * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
 * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
 *
 * @param {Matrix}  g               The G matrix
 * @param {Matrix}  b               The B matrix
 * @param {Number}  k               The kth column in B
 * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
 *                                  The first n entries is the nonzero pattern, the last n entries is the stack
 * @param {Array}   pinv            The inverse row permutation vector
 *
 * @return {Number}                 The index for the nonzero pattern
 */
export declare function csReach(g: SparseMatrixData, b: SparseMatrixData, k: number, xi: number[], pinv: number[] | null): number;
export {};
//# sourceMappingURL=csReach.d.ts.map