AntInLoop

Hamiltonian Path & Cycle Interactive Visualizer

A Hamiltonian Path visits every vertex of a graph exactly once (a Hamiltonian Cycle returns to the start), an NP-complete problem solved exactly in O(2^n * n^2) via Bitmask DP for n <= 20.

Study Hamiltonian Path & Cycle Explanation · View Multi-Language Code · All Algorithms