A-level Mathematics/D1/Node Graphs/Travelling Salesperson Problem

From Wikibooks, the open-content textbooks collection

The Travelling Salesperson (split into Upper and Lower Bound algorithms) requires that one visits each node at least once and returns to the start node in a 'Hamiltonian Cycle'

A reader has identified this page or section as an undeveloped draft or outline. You can help to develop the work, or you can ask for assistance in the project room.