david-read-iii / shortest-path-problem Goto Github PK
View Code? Open in Web Editor NEWA command line Java program developed for an artificial intelligence college course. It applies the Shortest Path Problem to a graph of fictitious cities. It uses either Best First Search or Uniform Cost Search to provide the shortest path from one city in the graph to another.