The purpose of this project is to find the shortest path between two cooridnates on a map that has weights. The file "FindShortestRoadPath.java" contains the main method. when it is ran it will require 4 inputs: The graph file name which is provided as '.gr' file, the source, the destination and a name to output the result to a file with that name. If the output file with that name does not exist then a file with the name provided will be created and merge the results to it.
amersulieman / find_shortest_path Goto Github PK
View Code? Open in Web Editor NEWFind the shortest path between two cooridnates on a map that has weights.