import { Graph } from '../graph/graph';
import { CycleDetectedError, InvalidInputError } from '../types/errors';
import { Edge, Node } from '../types/graph';
import { Result } from '../types/result';
/**
 * Topological sort using DFS-based reverse postorder.
 *
 * Returns a linear ordering of vertices such that for every directed edge (u, v),
 * u comes before v in the ordering. Only works on Directed Acyclic Graphs (DAGs).
 *
 * Time Complexity: O(V + E)
 * Space Complexity: O(V)
 * @param graph - The directed graph to sort
 * @returns Result containing ordered nodes or cycle error
 */
export declare const topologicalSort: <N extends Node, E extends Edge = Edge>(graph: Graph<N, E>) => Result<N[], CycleDetectedError | InvalidInputError>;
//# sourceMappingURL=topological-sort.d.ts.map