a. Design and implement your own heuristic algorithm to find the (approximate) shortest TSP route among the points given in a two-dimensional space. Then apply the algorithm to the US State capital location data (e.g., “uscap_xy.txt” by John Burkardt; available from his CITIES website) and visualize the results.
b. Analyze the topological properties of the one of the network datasets available from Mark Newman’s network data website, and report at least three “interesting” findings about the network you chose. http://www-personal.umich.edu/~mejn/netdata/
Prepare your answers in a single PDF file and submit it through this Assignment page.
