Scheme Request for Implementation 234,
by John Cowan and Arvydas Silanskas, but based on Shiro Kawai's
implementation for Gauche,
is now available for discussion.
Its draft and an archive of the ongoing discussion are available at
You can join the discussion of the draft by filling out the subscription
form on that page.
You can contribute a message to the discussion by sending it to
Here's the 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