Editing Nearest neighbour algorithm (section)

{{Short description|Algorithm for the travelling salesman problem}}
{{About|an approximation algorithm to solve the [[travelling salesman problem]]||Nearest neighbor (disambiguation){{!}}Nearest neighbor}}

{{Infobox Algorithm
|class=[[Approximation algorithm]]
|image=
|caption=
|data=[[Graph (data structure)|Graph]]
|time=<math>\Theta(N^2)</math>
|space=<math>\Theta(N)</math>
|optimal=No
|complete=
}}
The '''nearest neighbour algorithm''' was one of the first [[algorithm]]s used to solve the [[travelling salesman problem]] approximately. In that problem, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. The algorithm quickly yields a short tour, but usually not the optimal one.