/**
 * Generic DFS-based topological sort.
 */
/**
 * Sort nodes in topological order (dependencies first).
 *
 * @param nodes - The items to sort.
 * @param getId - Extract a unique identifier from a node.
 * @param getEdges - Return the IDs of nodes that `node` depends on.
 * @returns Sorted array where dependencies appear before dependents.
 */
export declare function topoSort<T>(nodes: T[], getId: (node: T) => string, getEdges: (node: T) => string[]): T[];
//# sourceMappingURL=topo-sort.d.ts.map