GitHub - david-read-iii/Shortest-Path-Problem: A 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.

david-read-iii / Shortest-Path-Problem Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

A 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.

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
.idea		.idea
.settings		.settings
bin		bin
classes/artifacts/SearchMethods_jar		classes/artifacts/SearchMethods_jar
src		src
.classpath		.classpath
.gitattributes		.gitattributes
.project		.project
SearchMethods.iml		SearchMethods.iml