topological sort (ordering respecting dependencies) orders vertices in a directed acyclic graph (DAG) so every edge points forward. You use it when tasks have dependencies and you need valid execution order. Unlike regular sorting by value, topological sort respects precedence constraints.
You'll see this in build systems, course scheduling, and dependency resolution problems. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
