/**
 * PostgreSQL Introspection Tools - Graph Algorithms
 *
 * Pure graph algorithms: cycle detection, topological sort, depth calculation.
 * No database dependencies — operates on adjacency lists.
 */
/**
 * Detect circular dependencies using DFS
 */
export declare function detectCycles(adjacency: Map<string, string[]>): string[][];
/**
 * Topological sort using Kahn's algorithm
 * Returns null if cycles exist
 */
export declare function topologicalSort(adjacency: Map<string, string[]>, allNodes: Set<string>): string[] | null;
/**
 * Calculate max depth from root nodes in DAG
 */
export declare function calculateMaxDepth(adjacency: Map<string, string[]>, roots: string[]): number;
//# sourceMappingURL=algorithms.d.ts.map