Computer Science Distilled: Learn the Art of Solving Computational Problems (Code is Awesome)

by Wladston Ferreira Filho

Here's a simple greedy algorithm for this problem: 1. Visit the nearest unvisited city. 2. Repeat until all cities are visited.