import type { ICopy, Nullable, Pair } from "@thi.ng/api";
import { ArraySet } from "@thi.ng/associative/array-set";
import { EquivMap } from "@thi.ng/associative/equiv-map";
/**
 * {@link DGraph} factory function using optional provided edge pairs. If given,
 * each pair is a `[node, parent]` tuple, or using `[node, null]` to merely
 * register a node in the graph (without dependencies).
 *
 * @param edges -
 */
export declare const defDGraph: <T>(edges?: Iterable<Pair<T, Nullable<T>>>) => DGraph<T>;
export declare class DGraph<T> implements Iterable<T>, ICopy<DGraph<T>> {
    dependencies: EquivMap<T, ArraySet<T>>;
    dependents: EquivMap<T, ArraySet<T>>;
    constructor(edges?: Iterable<Pair<T, Nullable<T>>>);
    [Symbol.iterator](): Generator<T, void, unknown>;
    get [Symbol.species](): typeof DGraph;
    copy(): DGraph<T>;
    addNode(node: T): this;
    addDependency(node: T, dep: T): this;
    addDependencies(node: T, deps: Iterable<T>): void;
    removeEdge(node: T, dep: T): this;
    removeNode(x: T): this;
    depends(x: T, y: T): boolean;
    dependent(x: T, y: T): boolean;
    immediateDependencies(x: T): Set<T>;
    immediateDependents(x: T): Set<T>;
    isLeaf(x: T): boolean;
    isRoot(x: T): boolean;
    nodes(): Set<T>;
    leaves(): IterableIterator<T>;
    roots(): IterableIterator<T>;
    transitiveDependencies(x: T): Set<T>;
    transitiveDependents(x: T): Set<T>;
    sort(): T[];
}
//# sourceMappingURL=index.d.ts.map