/**
 * Generic topological sort using Kahn's algorithm.
 *
 * Orders items so that dependencies come before dependents.
 * Works with any item type that has `id` and optional `depends_on`.
 *
 * @module
 */
/**
 * Minimum shape required for topological sorting.
 */
export interface Sortable {
    id: string;
    depends_on?: Array<string>;
}
/**
 * Result of topological sort.
 */
export type TopologicalSortResult<T extends Sortable> = {
    ok: true;
    sorted: Array<T>;
} | {
    ok: false;
    error: string;
    cycle?: Array<string>;
};
/**
 * Sort items by their dependencies using Kahn's algorithm.
 *
 * Returns items ordered so that dependencies come before dependents.
 * If a cycle is detected, returns an error with the cycle path.
 *
 * @param items - array of items to sort
 * @param label - label for error messages (e.g. "resource", "step")
 * @returns sorted items or error if cycle detected
 */
export declare const topological_sort: <T extends Sortable>(items: Array<T>, label?: string) => TopologicalSortResult<T>;
//# sourceMappingURL=sort.d.ts.map