Created: 2020-12-27T20:42:33-06:00
Given a graph with no cycles: create a list of nodes wherein nodes with less dependencies appear earlier in the list.
Topological sorts can be used to turn a graph of dependencies in to an orderred list of tasks to perform.