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

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 page or section is an undeveloped draft or outline.You can help to develop the work, or you can ask for assistance in the project room. |