Topological Sort
Given a graph, G = (V, E), output all the vertices in V such that no vertex is output before any other vertex with an edge to it.
Beware the Catch-22!
Previous slide
Next slide
Back to first slide
View graphic version