Topological Sort is a pupiling algorithm that is implemented on directed acyclic graphs (DAG) where vertices interlinked by directed edges are systematically ordered in such a way that if edge UV exists then U must appear before V in this order. Its applications are related to scheduling problems such that some tasks need to be done before others are attended to. The algorithm comprises Depth First Search (DFS), and a stack which is used to unwind the order of attending to nodes in the depth-first process to make sure that stakeholders are attended to before their stakeholders.