Dependency resolution based on topological sort of a directed graph (for arbitrary types)
-
Updated
Jun 25, 2024 - Go
Dependency resolution based on topological sort of a directed graph (for arbitrary types)
native golang implementation of a node, edge, graph, directed acyclic graph, topological sort algorithm, and coffman-graham algorithm
Go-based continuous integration system that runs pipelines optimally in Docker containers
golang native scheduler for tasks with dependencies
Topological sort in plain PL/PgSQL (and hstore)
topological sort of directed acyclic graph
Add a description, image, and links to the topological-sort topic page so that developers can more easily learn about it.
To associate your repository with the topological-sort topic, visit your repo's landing page and select "manage topics."