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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/david-read-iii%2FShortest-Path-Problem
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Java
Size: 62.5 KB
Dependencies parsed at: Pending
Created at: about 5 years ago
Updated at: about 3 years ago
Pushed at: over 3 years ago
Last synced at: about 2 months ago
Topics: best-first-search, java, shortest-path-problem, uniform-cost-search