Detour: The BEST Theorem

Learn the BEST theorem for computing the number of Eulerian cycles in a graph.

Given an adjacency matrix A(G)A(G) of a directed Eulerian graph GG, we define the matrix A(G)A^∗(G) by replacing the i-th diagonal entry of A(G)−A(G) by InDegree(i) for each node i in GG (the figure below).

Get hands-on with 1200+ tech skills courses.