Acyclic Packages

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).

a Functional Directed Acyclic Graph

Explore the IPLD directed acyclic graph with your keyboard

Asynchronous Dependency Resolver

Pay using IOTA

Run a topology created with topology-runner using nats-jobs

Topological sorting for JavaScript

DAG stands for “Directed Acyclic Graph”. DAGs represent a series of activities that happen in a specific order and do not self-reference (loop).

Simple library to search and traverse graphs using DFS, BFS algorithms, and also detect cycles in directed graph input