Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

topological sorting

Lining up the vertices of a directed acyclic graph so every edge points from an earlier vertex to a later one.

A topological sort of a directed acyclic graph (DAG) is a linear ordering of its vertices such that for every directed edge $u\to v$ , $u$ comes before $v$ in the ordering.