Topological sort of directed ascyclic graphs (like dependecy lists)
Topological sorting with grouping support
Topological sort of directed acyclic graphs (like dependecy lists)
A tiny dependency solver using topological sorting
Toposort an object that happens to be an adjacency list graph.
Asynchronous Dependency Resolver
Topologically sort Gert graphs
Merge two lists, trying to preserve the order of both
Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.
Topological sort on directed graphs.
Strict topological sorting
topologically sorts and divides a dag into almost disjoint subsets
Utilities to define graphs for your apps and schedule the execution of operations, fast.
Run async tasks with dependencies
a topological cyclic sorting algorithm based on depth-first search (dfs)
A concatenation tool ripped from the insides of PrePros.
powered by npms.io 🚀