/**
 * Minimal binary min-heap.
 *
 * Used by the Dijkstra router. The grid is small (≤25 intersections on
 * a 4×4 layout) so absolute throughput barely matters here, but the
 * previous "sort-on-every-pop" array was O(V² log V) and pq.shift() was
 * itself O(V) — replacing it with a proper heap also makes the routing
 * cost predictable for larger custom layouts.
 */
export declare class MinHeap<T> {
    private readonly compare;
    private data;
    constructor(compare: (a: T, b: T) => number);
    get size(): number;
    push(item: T): void;
    pop(): T | undefined;
    private bubbleUp;
    private bubbleDown;
}
//# sourceMappingURL=heap.d.ts.map