export declare class Node<T> {
    readonly id: string;
    value: T;
    incomingNeighbors: string[];
    constructor(id: string, value: T);
}
export declare enum SearchAlgorithmNodeBehavior {
    continue = 0,
    break = 1
}
export type OnNodeFn<T> = (node: Node<T>, cost?: number) => SearchAlgorithmNodeBehavior;
export type OnNodeFnAsync<T> = (node: Node<T>, cost?: number) => Promise<SearchAlgorithmNodeBehavior>;
export interface Options {
    weighted?: boolean;
}
export interface NodeDistance {
    [nodeId: string]: number;
}
export declare class Graph<T> {
    private _nodes;
    private _nodesById;
    private _edges;
    readonly weighted: boolean;
    constructor({ weighted }?: Options);
    private getNodeById;
    addNode(value: Node<T>): void;
    addEdge(node1: Node<T>, node2: Node<T>, weight?: number): void;
    removeNode(node: Node<T>): void;
    removeEdge(node1: Node<T>, node2: Node<T>): void;
    isEmpty(): boolean;
    getNeighbors(node: Node<T>): Array<Node<T>>;
    kahnTopologicalSort(): Array<Node<T>>;
    bfs(onNode: OnNodeFn<T>, initialNode?: Node<T>): void;
    bfsAsync(onNode: OnNodeFnAsync<T>, initialNode?: Node<T>): Promise<void>;
    dfs(onNode: OnNodeFn<T>, initialNode?: Node<T>): void;
    dfsAsync(onNode: OnNodeFnAsync<T>, initialNode?: Node<T>): Promise<void>;
    dijkstra(originalNode: Node<T>): NodeDistance;
}