Paths and Networks
Traveling Salesman Calculator use with section: 6.2
Applet 9. Travelling Salesman Problem (TSP) Calculator The user enters vertices on a map or distances between vertices. The applet applies the nearest neighbor algorithm (with a user-chosen start point) or the greedy-algorithm. It also calculates the minimal weight circuit by brute force for a sufficiently small number of vertices. The background map can be set by the instructor or left blank.
