Topological Sort

Ordering a dependency graph so nothing is built before what it needs, demoing the p/moul/x/daily/toposort library.

The graph

avl <- strings
markdown <- strings
realm <- storage, ui
storage <- avl
strings
ui <- markdown

Install order

1. strings
2. avl
3. markdown
4. storage
5. ui
6. realm

Ties are broken lexicographically, so this ordering is the only one the library will ever produce for this graph.

See /cycle for what happens when the graph is not a DAG.