/**
 * Dependency graph data structure
 */
import type { DependencyNode } from './types';
export declare class DependencyGraph {
    private nodes;
    private adjacencyList;
    /**
     * Add a node to the graph
     */
    addNode(node: DependencyNode): void;
    /**
     * Add an edge from one node to another
     */
    addEdge(from: string, to: string): void;
    /**
     * Get a node by name
     */
    getNode(name: string): DependencyNode | undefined;
    /**
     * Get dependencies of a node (what this node depends on)
     */
    getDependencies(name: string): string[];
    /**
     * Get dependents of a node (what depends on this node)
     */
    getDependents(name: string): string[];
    /**
     * Get all node names
     */
    getNodes(): string[];
    /**
     * Get all nodes as an array
     */
    getAllNodes(): DependencyNode[];
    /**
     * Check if a node exists
     */
    hasNode(name: string): boolean;
    /**
     * Get the size of the graph (number of nodes)
     */
    size(): number;
    /**
     * Clear the graph
     */
    clear(): void;
    /**
     * Get topological sort of the graph (if acyclic)
     * Returns nodes in dependency order (dependencies before dependents)
     */
    topologicalSort(): string[] | null;
}
//# sourceMappingURL=graph.d.ts.map