Image of 1
- Use your left and right arrow keys to navigate the gallery
The Hamiltonian Path Problem is to start at node 1, end at node 5,and visit each node exactly once. (For those without a bacterial computer the answer is 1→4→7→2→3→6→5).
See the stories that matter in your inbox every morning