Topological sort of directed ascyclic graphs (like dependecy lists)
TypeScript definitions for toposort
toposort using modern ecma script data structures
toposort with objects
Topological sort of directed acyclic graphs (like dependecy lists)
An esm-variant of the 'toposort' package
Efficiently sort interdependent tasks into a sequence of concurrently-executable batches.
Fork of [toposort](https://github.com/marcelklehr/toposort) with updated dependencies and some new features
Fork of [toposort](https://github.com/marcelklehr/toposort) with updated dependencies and some new features
Topological sort of directed ascyclic graphs (like dependecy lists)
> A modified implementation of [Kahn's Algorithm](https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm) > for [topologically sorting](https://en.wikipedia.org/wiki/Topological_sorting) a > [graph.js](https://github.com/mhelvens/graph.js) i
Toposort an object that happens to be an adjacency list graph.
A simple and efficient topological sorting algorithm for directed graphs.
TypeScript version: Efficiently sort interdependent tasks into a sequence of concurrently-executable batches.
graph toposort with c++ addon
Topological sort of directed acyclic graphs (like dependency lists)
flexible topological sorting of different DAG structures
Lerna-Lite list commmand - List local packages
Topological sort of directed ascyclic graphs (like dependecy lists)
Install and run python dependencies in node.js project.
Lerna-Lite changed commmand - List local packages that have changed since the last tagged release
Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.
sort objects with dependencies
No description provided.
Topological sorting
Deterministic and stable topological sorting algorithms
An implementation of Kahn's algorithm for topological sorting and Kosaraju's algorithm for strongly connected components
A 'cycle-safe' topological sort for a set of nodes with dependencies
Graph algorithms for version control systems: topological sort, merge-aware sort, parent maps, and ancestry queries.
no-std topological sort using `heapless`
Find the strongly-connected components of a graph with nodes labeled by integer ids
A miniscule thread pool and toposort scheduler
Embedded graph database with full ACID transactions, HNSW vector search, dual backend support, and comprehensive graph algorithms library
Library and CLI utility for interacting with SWC neuronal morphology files
Core runtime management for User-Space Capsules in Astrid OS
Rust-native Infrastructure as Code — bare-metal first, BLAKE3 state, provenance tracing
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.