Batching‑Toposort is a small, dependency‑free NPM library that takes a directed‑acyclic graph expressed as an adjacency list and returns the tasks grouped into ordered batches that can be run in parallel. It implements a linear‑time ( O(V + E) ) version of Kahn’s topological‑sort algorithm, throwing an error on cyclic graphs, and is aimed at developers who need to schedule inter‑dependent jobs (e.g., build pipelines, task runners, or job schedulers) while maximizing concurrency.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.