import { Graph } from '../../../../../algorithms/graph/graph.js';
import { Edge, Node } from '../../../../../algorithms/types/graph.js';
import { GraphExpander, Neighbor } from '../../../../../interfaces/graph-expander';
export declare class BenchmarkGraphExpander implements GraphExpander<{
    id: string;
}> {
    private graph;
    private adjacency;
    private degrees;
    private nodeIds;
    private nodeIndex;
    private edgesBySource;
    private edgesByTarget?;
    private adjacencyBuilt;
    private directed;
    constructor(graph: {
        getAllNodes: () => Array<{
            id: string;
        }>;
        getAllEdges: () => Array<{
            source: string;
            target: string;
        }>;
    }, directed: boolean);
    getNeighbors(nodeId: string): Promise<Neighbor[]>;
    getDegree(nodeId: string): number;
    /**
     * Build adjacency for a specific node on-demand using binary search.
     * Only processes the subset of edges relevant to this node.
     * @param nodeId
     */
    private buildAdjacencyForNode;
    getNode(nodeId: string): Promise<{
        id: string;
    } | null>;
    addEdge(): void;
    calculatePriority(nodeId: string, options?: {
        nodeWeight?: number;
        epsilon?: number;
    }): number;
    getNodeCount(): number;
    getAllNodeIds(): string[];
    /**
     * Get the degree distribution for statistical analysis.
     */
    getDegreeDistribution(): Map<number, number>;
    getAllDegrees(): Map<string, number>;
    /**
     * Convert this expander to a Graph instance for use with algorithms.
     *
     * Creates a new Graph populated with nodes and edges from this expander.
     * This allows using the expander with algorithms that expect Graph interface.
     *
     * @returns A Graph instance compatible with path ranking algorithms
     */
    toGraph(): Promise<Graph<Node, Edge>>;
}
//# sourceMappingURL=benchmark-graph-expander.d.ts.map