It sorts the directed graph in a linear ordering where each vertices like uv from the vertex u to vertex v,u comes before v in the ordering. Applications: School class prerequisites Task scheduling system in a distributed system. etcTopological Sorting Conditions No directed cycles in the graph At least one topological sorting for every Directed Acyclic Graph Kahn's algorithm DFS We cannot u..
