Documentation

Topological sort with smallest-numbered available vertex first. Returns Nothing if the graph is not a DAG.

Note: should be stable to preserve order of generalizable variables. Algorithm due to Richard Eisenberg, and works by walking over the list left-to-right and moving each node the minimum distance left to guarantee topological ordering.