Jump to content

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

From Wikibooks, open books for an open world

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'