Back to Developer Roadmap

Finding Hamiltonian Paths

src/data/roadmaps/computer-science/content/finding-hamiltonian-paths@aBjBHpq_OajgQjxdCobXD.md

4.0749 B
Original Source

Finding Hamiltonian Paths

Hamiltonian paths are paths that visit every node in a graph exactly once. They are named after the famous mathematician Hamilton. Hamiltonian paths are a special case of Hamiltonian cycles, which are cycles that visit every node in a graph exactly once.

Visit the following resources to learn more: