Topological sort in plain PL/PgSQL (and hstore)
-
Updated
Jul 23, 2017 - Go
#
kahns-algorithm
Here are 4 public repositories matching this topic...
C implementation of bidirectional source-sink peeling: linear-time O(V+E) cycle detection for directed dependency graphs. Repeatedly removes vertices with zero in-degree or zero out-degree; whatever remains contains a cycle.
c algorithm graph-algorithms dependency-graph data-structures graph-theory topological-sort dag graph-reduction strongly-connected-components cycle-detection directed-acyclic-graph adjacency-list kahns-algorithm
-
Updated
Sep 9, 2026 - C
Educational implementation of Kahn’s topological sort, featuring a reusable generic library, deterministic JSON CLI, cycle detection, and xUnit tests.
-
Updated
Jul 22, 2026 - C#
Visual node-based pipeline builder (React + React Flow) with a FastAPI backend that validates the graph as a cycle-free DAG using Kahn's algorithm.
-
Updated
Aug 13, 2026 - JavaScript
Add this topic to your repo
To associate your repository with the kahns-algorithm topic, visit your repo's landing page and select "manage topics."