Results for topologicalsort

Topological sort of directed graphs

Directed acyclic graph functions for graphology.

A graph data structure with topological sort.

Topological sort

A lightweight, TypeScript-based utility for performing **topological sorting** on **Directed Acyclic Graphs (DAGs)**. This package allows you to efficiently sort nodes of a DAG, detecting any cycles that might prevent a valid sort.

Core utilities for Genfeed workflow engine

CMPSBL® Convex Core™ Processing Layer — CJPI scoring, auto-tiering, pipeline orchestration, manifest parsing, and full 131-primitive catalog. Zero dependencies.

Dependency graph algorithms for monorepo package analysis

<div align="center"> <h1> <img src="https://unpkg.com/graph-fns/logo.png" alt="graph-fns" width="160" /> </h1> <p>A JavaScript utility library for working with graphs.</p> <p> <img alt="npm bundle size" src="https://img.shields.io/bundleph

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

Graph data structures for node-based editors

<div align="center"> <h1> <br/> <img src="./docs/logo.svg"> <br /> Data structures library <br /> <br /> <br /> </h1> <sup> <br /> <br /> <a href="https://www.npmjs.com/package/@zmitry/struct"> <img src=

A graph data structure with topological sort.