/**
 * Based on the paper ["A New Approach to Incremental Cycle Detection and Related Problems"](https://doi.org/10.1145/2756553).
 * This is the first algorithm they present in their paper in Section 2.
 **/
export declare class OnlineDAG<V> {
    #private;
    constructor();
    addVertex(vertex: V): boolean;
    hasVertex(vertex: V): boolean;
    hasEdge(from: V, to: V): boolean;
    /** Returns true if the edge is part of the graph afterwards, false if the edge was rejected because of a cycle. */
    addEdge(from: V, to: V): boolean;
}