Least You Need to Know: Topological Sort, DAG Dependencies, and Prerequisite Order
เปิดบทเรียน
Topological sorting gives an order that respects directed dependencies: every edge points from something that must come earlier to something that may come later. It only works when the graph is a DAG.