SRFI 234: Topological Sorting

by John Cowan (spec) and Arvydas Silanskas (implementation)

status: draft (2022-08-10)

keywords: Algorithm

Abstract

Topological sorting is an algorithm that takes a graph consisting of nodes and other nodes that depend on them, forming a partial order, and returns a list representing a total ordering of the graph. If the graph is cyclic, the topological sort will fail, and an error will be signaled.