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 connected components in an undirected graph (or weakly connected components in directed graph).
 *
 * Uses DFS to traverse each component. For directed graphs, treats edges as undirected.
 *
 * Time Complexity: O(V + E)
 * Space Complexity: O(V)
 * @param graph - The graph to analyze
 * @returns Result containing array of components
 */
export declare const connectedComponents: <N extends Node, E extends Edge = Edge>(graph: Graph<N, E>) => Result<Component<N>[], InvalidInputError>;
//# sourceMappingURL=connected-components.d.ts.map