Topological Sort

Orders the vertices of a directed acyclic graph so that all directed edges go from earlier in the order to later.

Category: graph

Enjoy reading code with a tandem explainer?

Explain code with DocComment! Try out your own code!