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

distance

The length of the shortest path between two vertices, counted by number of edges.

The distance $d(u,v)$ between vertices $u,v$ is the number of edges on a shortest $u$ – $v$ path, or $\infty$ if no path exists (they lie in different components).