1. There is an extended version of the nearest-neighbor algorithm in which you compare the total distances of the Hamiltonian circuits produced by applying the ordinary nearest-neighbor algorithm starting at each of the vertices of the graph (rather than just a specific one). Explore the effectiveness of this algorithm using the TSP: Nearest-Neighbor applet.