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

< A-level Mathematics < OCR < D1 < Node Graphs

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'

This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.