Topological Sort orders the vertices of a directed acyclic graph (DAG) such that for every directed edge u → v, u comes before v in the ordering.
Paradigm
Graph / DFS-Based
Author
Computer Science Researchers
Tier
Time Complexity
Best
Avg
Worst
Space
O(V + E)
Properties