A Nearest Neighbor Solution in Go to the Traveling Salesman Problem
Published in
7 min readOct 28, 2020
Summary
A Go implementation of the Nearest Neighbor algorithm is presented with the charting of the path and supporting report output. A circular set of Nodes shows the implementation is reasonably accurate for the algorithm. The project is hosted publicly on gitlab as noted in reference 6.
