/**
 * Dependency Graph Analyzer
 */
import { DependencyGraph, ParsedTask, ParsingError } from './types';
/**
 * Dependency Graph Builder and Analyzer
 */
export declare class DependencyGraphAnalyzer {
    private logger;
    constructor();
    /**
     * Build dependency graph from parsed tasks
     */
    buildGraph(tasks: ParsedTask[]): DependencyGraph;
    /**
     * Calculate topological levels using BFS
     */
    private calculateTopologicalLevels;
    /**
     * Find critical path using dynamic programming
     */
    private findCriticalPath;
    /**
     * Detect cycles in the dependency graph
     */
    detectCycles(graph: DependencyGraph): string[][];
    /**
     * Get execution levels (tasks that can run in parallel)
     */
    getExecutionLevels(graph: DependencyGraph): string[][];
    /**
     * Calculate parallelism metrics
     */
    calculateParallelism(graph: DependencyGraph): {
        maxParallelism: number;
        averageParallelism: number;
        parallelismByLevel: Map<number, number>;
    };
    /**
     * Optimize graph by removing redundant dependencies
     */
    optimizeGraph(graph: DependencyGraph): void;
    /**
     * Check if target is reachable from source
     */
    private isReachable;
    /**
     * Get all dependencies of a task (including transitive)
     */
    getAllDependencies(graph: DependencyGraph, taskId: string): Set<string>;
    /**
     * Get all dependents of a task (including transitive)
     */
    getAllDependents(graph: DependencyGraph, taskId: string): Set<string>;
    /**
     * Validate dependency graph
     */
    validateGraph(graph: DependencyGraph): ParsingError[];
}
//# sourceMappingURL=dependency-graph.d.ts.map