import { F, N, A, S } from './baseType';
declare type ShortestPathObj<T> = {
    distance: Map<T, N>;
    predecessors: Map<T, T>;
};
interface Vertex<T> {
    data: T;
    inDegree: N;
    outDegree: N;
    status: A;
    dTime: N;
    fTime: N;
}
interface Edge<T> {
    data: A;
    start: Vertex<T>;
    end: Vertex<T>;
    weight: N;
    status: A;
}
declare type EdgeOrNull<T> = Edge<T> | null;
interface Graph<T> {
    vertexMap: Map<T, Vertex<T>>;
    adjMatrix: Map<T, Map<T, EdgeOrNull<T>>>;
    adjTable: Map<T, Set<Vertex<T>>>;
    createVertex: (v: T) => Vertex<T>;
    createEdge: (a: T, b: T) => Edge<T>;
    putVertex: (a: T) => void;
    edgeList: () => Edge<T>[];
    removeVertex: (a: T) => Vertex<T> | undefined;
    bfs: (data: T, cb: F) => void;
    dfs: (data: T, cb: F) => void;
    shortestPath: (data: T) => ShortestPathObj<T>;
    getPath: (from: T, to: T) => T[];
    reset: (p: S) => void;
}
interface DirectionGraph<T> extends Graph<T> {
    putEdge: (a: T, b: T) => void;
    removeEdge: (a: T, b: T) => Edge<T> | undefined;
}
interface UndirectionGraph<T> extends Graph<T> {
    putEdge: (a: T, b: T) => void;
    removeEdge: (a: T, b: T) => Edge<T>[];
}
export { Vertex, Edge, EdgeOrNull, Graph, DirectionGraph, UndirectionGraph, };