🚀 go-pugleaf

A Topological Sort is a function that takes a partial ordering of
objects and generates a full ordering of those objects.  A partial
order is one in which the 'a is before b' relationship is defined for
some pairs of objects in the collection, but not necessarily for all.

A topological sort generates an ordering such that for any two objects
in the collection, their relative ordering is preserved.

'Topological' comes from visualizing the collection as a graph, where
the objects are dots, and edges with arrow-heads connect two dots if
one precedes the other.

You can topologically sort any directed acyclic graph -- if any cycles
occur, then an object precedes itself.
--
Kent Williams                    'Look, I can understand "teenage mutant ninja 
williams@umaxc.weeg.uiowa.edu    turtles", but I can't understand "mutually 
williams@herky.cs.uiowa.edu      recursive inline functions".' - Paul Chisholm