Hamiltonian Path

The animation shows a 5-node pentagon graph where an orange path sequentially connects nodes B→A→E→D→C, illustrating a Hamiltonian path that visits every node exactly once. It includes step numbers, a final caption, and a fade-out for looping, though the opening title may appear slightly cut off due to its write-on animation.