import { Vertex as V, Edge as E, Graph as G, DirectionGraph as DG, UndirectionGraph as UG, F, S } from '../typings';
declare class Graph<T> implements G<T> {
    vertexMap: G<T>['vertexMap'];
    adjMatrix: G<T>['adjMatrix'];
    adjTable: G<T>['adjTable'];
    constructor();
    createVertex(v: T): {
        data: T;
        inDegree: number;
        outDegree: number;
        status: string;
        dTime: number;
        fTime: number;
    };
    createEdge(a: T, b: T): {
        data: string;
        start: V<T>;
        end: V<T>;
        weight: number;
        status: string;
    };
    putVertex(v: T): void;
    edgeList(): E<T>[];
    removeVertex(p: T): V<T>;
    reset(p?: S): void;
    _bfs(vertex: V<T>, cb: F): void;
    bfs(data: T, cb: F): void;
    _dfs(vertex: V<T>, cb: F): void;
    dfs(data: T, cb: F): void;
    shortestPath(data: T): {
        distance: Map<any, any>;
        predecessors: Map<any, any>;
    };
    getPath(from: T, to: T): T[];
}
declare class DirectionGraph<T> extends Graph<T> implements DG<T> {
    constructor();
    putEdge(a: T, b: T): void;
    removeEdge(a: T, b: T): E<T>;
}
declare class UndirectionGraph<T> extends Graph<T> implements UG<T> {
    constructor();
    putEdge(a: T, b: T): void;
    removeEdge(a: T, b: T): any[];
}
export { DirectionGraph, UndirectionGraph, };