export declare namespace graph {
    /**
     * Edge of a graph
     */
    interface IEdge<Node> {
        n0: Node;
        n1: Node;
    }
    /**
     * Implementation of IEdge
     */
    class Edge<Node> implements IEdge<Node> {
        n0: Node;
        n1: Node;
        constructor(n0: Node, n1: Node);
    }
    /**
     * Labeled edge of a graph
     */
    interface ILabeledEdge<Node, Label> extends IEdge<Node> {
        label: Label;
    }
    /**
     * Implementation of ILabeledEdge
     */
    class LabeledEdge<Node, Label> extends Edge<Node> {
        label: Label;
        constructor(n0: Node, n1: Node, label: Label);
    }
    /**
     * Undirected graph with labeled edges
     */
    class LabeledUndirectedGraph<Node, Label> {
        /**
         * The set of nodes.
         */
        nodes: Set<Node>;
        /**
         * The set of edges.
         */
        edges: Set<ILabeledEdge<Node, Label>>;
        /**
         * @param edges The set of edges.
         * @param nodes The set of nodles.
         */
        constructor(edges: Set<ILabeledEdge<Node, Label>> | Array<ILabeledEdge<Node, Label>>, nodes?: Set<Node> | Array<Node>);
        /**
         * @param node - The target node
         * @return he set of nodes that are neighbors of the node.
         */
        neighborsOf(node: Node): Set<[Node, Label]>;
        private neighborLists;
    }
    /**
     * Directed graph
     */
    class DirectedGraph<Value> {
        /**
         * The set of nodes.
         */
        nodes: Set<Set<Value>>;
        /**
         * The set of edges.
         */
        edges: Set<IEdge<Set<Value>>>;
        /**
         * @param nodes The set of nodes.
         * @param edges The set of edges.
         */
        constructor(edges: Set<IEdge<Set<Value>>> | Array<IEdge<Set<Value>>>, nodes?: Set<Set<Value>> | Array<Set<Value>>);
        outgoingNodesOf(node: Set<Value>): Set<Set<Value>>;
        incomingNodesOf(node: Set<Value>): Set<Set<Value>>;
        /**
         * @return The cycle that is contained this graph. If there are no cycles, returns null.
         */
        getCycle(): Array<Set<Value>> | null;
        /**
         * Deletes a node.
         * @param node The node to be deleted.
         * @return The directed graph that deletes the node.
         */
        deleteNode(node: Set<Value>): DirectedGraph<Value>;
        /**
         * Merges nodes into one node.
         * @param nodes The nodes to be merged.
         * @return The directed graph that merges the nodes into one node.
         */
        mergeNodes(target: Set<Set<Value>>): DirectedGraph<Value>;
        private neighborLists;
    }
}