Topological Sort

Definition

An algorithm that orders a Directed Acyclic Graph (DAG) linearly such that for every directed edge u -> v, vertex u comes before v. Classic algorithm is Kahn's (In-degree calculation).

Explain Like I'm New

Figuring out the exact order you must take college classes in, given that some classes are prerequisites for others.

Interactive Coding Challenges

Course Schedule (Kahn's Algorithm)

Solution Code

Console output will appear here...