toposort
Topological sort of directed ascyclic graphs (like dependecy lists)
Topological sort of directed ascyclic graphs (like dependecy lists)
Topological sort of directed acyclic graphs (like dependecy lists)
Directed acyclic graph
toposort with objects
sort objects with dependencies
Keeps a directed acyclic graph topologically sorted each time you add an edge or vertex to check for cycles.
Simiple DAG (Directed Acyclic Graph) module with edge tagging
Calculate user progress for each vertex in an acyclic digraph
Topologically sort directed acyclic graph with fast tracking
simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks
DAGs on top of hypercore, allowing verified random-access to graph nodes
A directed acyclic graph with constant time access to a node's sources and targets (dependencies and dependants).
Explore the IPLD directed acyclic graph with your keyboard
a Functional Directed Acyclic Graph
Asynchronous Dependency Resolver
Pay using IOTA
A simple and efficient topological sorting algorithm for directed graphs.
dag-builder-js is a simple-to-use Javascript DAG library with support to N:N vertices/edges. It supports validating that no cycle can be created in real-time, import/export states and it's built on SVG so you can render graphs pretty much anywhere.
Directed Graph
Run a topology consisting of a directed acyclic graph