Topological Sort
Topological sorting is a linear ordering of the vertices of a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u comes before vertex v in the ordering. A Directed Acyclic Graph (DAG) is a graph that is directed, meaning that edges have a direction, and it is acyclic, meaning that
