Topological sorting

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.

• Kahn's algorithm
• Depth-first algorithm