Graphs 0/61

Topological sort: ordering directed graphs · 2 of 3

Topological sort

Build a topological order with Kahn's algorithm, tell from its length whether one exists, choose among several valid orders, and compute values such as route counts in that order.

2,742 words · 13 min read

0 of 5 solved

Difficulty: how hard each problem is if its topic is new to you.

Core 5