import type { LabeledGraph } from "./types";
/**
 * A graph for connecting any kind of JavaScript object by making use of the
 * native `Map` and `Set` primitives.
 *
 * Much like a ES6 Map or Set, this graph type guarantees that insertion order
 * is preserved for vertices. For example, if you add node A after B,
 * `getVertices()` will always retun `['B', 'A']`.
 */
export declare class LabeledDirectedHashGraph<V, L> implements LabeledGraph<V, L> {
    private nodes;
    private sourceToTarget;
    private targetToSource;
    edgeCount: number;
    constructor(iterable?: Iterable<[V, V, L]>);
    get vertexCount(): number;
    hasEdge(a: V, b: V, label?: L): boolean;
    addEdge(source: V, target: V, label: L): void;
    deleteEdge(a: V, b: V, label?: L): void;
    deleteVertex(node: V): void;
    getSourceVertices(node: V): Iterable<V>;
    getTargetVertices(node: V): Iterable<V>;
    getIncomingEdges(node: V): Iterable<[V, L]>;
    getOutgoingEdges(node: V): Iterable<[V, L]>;
    getVertices(): Iterable<V>;
    addVertex(v: V): void;
    hasVertex(v: V): boolean;
    getEdges(): Iterable<[V, V, L]>;
}
//# sourceMappingURL=LabeledDirectedHashGraph.d.ts.map