interface SparseMatrixData {
    _size: number[];
    _values?: unknown[];
    _index: number[];
    _ptr: number[];
}
/**
 * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
 * at nodes in B (see csReach()).
 *
 * @param {Number}  j               The starting node for the DFS algorithm
 * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored
 * @param {Number}  top             Start index in stack xi[top..n-1]
 * @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, must be null for L * x = b
 *
 * @return {Number}                 New value of top
 */
export declare function csDfs(j: number, g: SparseMatrixData, top: number, xi: number[], pinv: number[] | null): number;
export {};
//# sourceMappingURL=csDfs.d.ts.map