import { Graph } from '../graph/graph';
import { Component } from '../types/algorithm-results';
import { InvalidInputError } from '../types/errors';
import { Edge, Node } from '../types/graph';
import { Result } from '../types/result';
/**
 * Find all strongly connected components using Tarjan's algorithm.
 *
 * A strongly connected component (SCC) is a maximal set of vertices where
 * every vertex is reachable from every other vertex in the set.
 *
 * Time Complexity: O(V + E)
 * Space Complexity: O(V)
 * @param graph - The directed graph to analyze
 * @returns Result containing array of SCCs
 */
export declare const stronglyConnectedComponents: <N extends Node, E extends Edge = Edge>(graph: Graph<N, E>) => Result<Component<N>[], InvalidInputError>;
//# sourceMappingURL=scc.d.ts.map