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

spanning tree count

How many distinct spanning trees a given graph contains, computed by the matrix-tree theorem.

A graph's spanning tree count is the number of distinct spanning trees it contains; the matrix-tree theorem computes it as a cofactor of the graph's Laplacian matrix.