Topological sorting

Home > Computer Science > Algorithms and data structures > Graphs > Topological sorting

A linear ordering of the vertices of a graph such that for every directed edge, the source vertex comes before the target vertex. Useful in scheduling and task ordering problems.