Type-agnostic directed acyclic graph (DAG), using @thi.ng/associative maps & sets as backend.

• cycle detection
• accessors for direct & transitive dependencies / dependents
• topological sorting
• iterable

yarn add @thi.ng/dgraph

import { DGraph } from "@thi.ng/dgraph";

g = new DGraph();
g.addDependency([1, 2], [10, 20]);
g.addDependency([3, 4], [30, 40]);
g.addDependency([1, 2], [3, 4]);

g.sort()
// [[30, 40], [3, 4], [10, 20], [1, 2]]

• Karsten Schmidt

© 2018 Karsten Schmidt // Apache Software License 2.0