Lab 1 - Shortest Route
Introduction - Find the arrangement of a list of points in R2 (two-dimensions) that results in the shortest
total point-to-point distance.
Program - Your program should:
1. Read list of points from a text file.
2. Compute distances between points as the Euclidean (straight-line) distance in the 2D plane.
3. Display a graphical representation of the set of points with a line showing the new ordering.
4. Output a text file using the same format as the input file with the points arranged to produce
the shortest total path length.
Data - Data is available in
http://csclab.murraystate.edu/~bob.pilgrim/445/assignments/
There are two versions of each data file, one with the number of points as the first data entry and the
other with just the x,y values of each point.
Support - The executable program Router.exe can be used to measure the path length for any point list.
It uses the version of data without the number of points as the first entry.
Submit - You should submit your source code (designer code not required), and output text files for each
of the five problems listed in the link above. All files should be submitted electronically by email.
Include the course number CSC445 in the subject line. Output files should be attachments.
Due Date - Feb 1, 2017