Due: R 12/7 @ 11:59 P.M.
For this project, we're going to France. Formidable!
Using Java, implement
Use the following latitudes and longitudes for the cities to write a function that returns the estimated distance between two cities.
Paris, 48:51:00N 2:20:00E Caen, 49:15:00N 0:20:00W Calais, 50:57:36N 1:57:00E Dijon, 47:21:00N 5:02:00E Lyon, 45:44:00N 4:52:00E Grenoble, 45:21:36N 5:19:12E Avignon, 43:50:00N 4:45:00E Marseille, 43:18:00N 5:25:00E Nice, 43:42:00N 7:21:00E Montpellier, 43:38:00N 3:53:00E Toulouse, 43:37:00N 1:27:00E Bordeaux, 44:50:00N 0:37:00W Limoges, 45:30:00N 1:10:00E Rennes, 48:07:00N 1:02:00W Brest, 48:24:00N 4:30:00W Strasbourg, 48:32:24N 7:37:34E Nancy, 48:50:00N 6:10:00E Nantes, 47:15:00N 1:30:00W
The file graph.txt should help you save a few keystrokes, especially if you know how to program. There is also a copy of this file on cs-class, which you can copy by executing
cs-class% cp ~maloofm/cosc574/graph.txt ./
Main.main should use each of the three search methods to find a path between the following initial and goal cities:
|Run||Initial State||Goal State|
Main.main should print the solution, the path cost of the solution, and the counts.
Name NetID In accordance with the class policies and Georgetown's Honor Code, I certify that, with the exceptions of the course materials and those items noted below, I have neither given nor received any assistance on this project.
When you are ready to submit your project, create the zip file for uploading by typing:
$ zip submit.zip Main.java (other java files) README HONORUpload submit.zip to Autolab. You can submit your assignment p3 five times. The autograder will simply call Main.main.
Copyright © 2019 Mark Maloof. All Rights Reserved. This material may not be published, broadcast, rewritten, or redistributed.