Skip to content

Traveling Salesman Problem

  • What is the shortest path that visits all nodes in the graph exactly once and returns to the starting node?

  • This is equivalent question - determine the shortest path of a hamiltonian cycle.