Applet uses best first search heuristic. Say there is a salesman in city 1 (node 1). The saleman wants to determine which route will be the shortest in order to visit all towns. The salesman will always travel to the nearest town. I implemented the applet with a team I was leading in my Software Engineering Class during my undergrad at Cal State San Bernardino. (CS455 Algorithma 2004)