Topological sort

Topological sorting with grouping support

Topological is a framework for building stream processing topologies, inspired by decades old dataflow processing patterns and more modern platforms like Apache Storm, that were designed to be as much about the distributed cluster they had to stand up as

Topological sort on directed graphs.

A graph data structure with topological sort.

Topological sort of directed ascyclic graphs (like dependecy lists)

Topological sort of directed acyclic graphs (like dependecy lists)

Topological indexing for simplicial complexes

Topological sorting and cycle detection. Optional grouping for parallel processing

Geometry library for topological robustness

Sort items in a graph using a topological sort

Sort items in a graph using a topological sort while resolving cycles with priority groups

Topological sort utility for directed acyclic graphs.

A tiny dependency solver using topological sorting

A graph data structure with topological sort.

Topological sort in JavaScript

Bun-native TypeScript workspace script runner with topological ordering

Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.

High-Performance topological sort / dependency resolver with optional grouping algorithm for Typescript

Component DAG runtime — topological scheduling with parallel branches