/**
 * Cycle detection using DFS with three-color marking (white/gray/black).
 *
 * Accepts either `Map<string, Set<string>>` or `Record<string, string[]>` as input.
 * Returns deduplicated cycles, each represented as an array of node IDs.
 */
type GraphInput = Map<string, Set<string>> | Record<string, string[]>;
/**
 * Detects cycles in a directed graph using DFS with three-color marking.
 *
 * @param graph - Adjacency list: node → neighbors. Accepts Map<string, Set<string>>
 *   or Record<string, string[]>.
 * @returns Array of deduplicated cycles. Each cycle is a node ID array
 *   (e.g. ["A", "B", "C"]). Self-loops return ["A"].
 */
export declare function detectCycles(graph: GraphInput): string[][];
/**
 * Normalize a cycle for deduplication.
 * Rotate to start with the lexicographically smallest node.
 */
export declare function normalizeCycleKey(cycle: string[]): string;
export {};
//# sourceMappingURL=cycles.d.ts.map