Topological Sort orders vertices in a directed acyclic graph (DAG) such that for every directed edge (u, v), vertex u comes before v. Essential for dependency resolution, task scheduling, and build systems.