Topological sorting algorithms for JavaScript. See docs.
⚠️ The code requiresregeneratorRuntimeto be defined, for instance by importing regenerator-runtime/runtime.
// Sort anything that can be iterated over with `for (const [u, v] of ...)`
import {sorted} from '@graph-algorithm/topological-sorting';
sorted(["ab", "bc"]); // abc
// Add a comparison function to break ties.
import {increasing} from '@total-order/primitive';
sorted(["ab", "cd"], increasing); // abcd
import {decreasing} from '@total-order/primitive';
sorted(["ab", "cd"], decreasing); // cdab