Welcome to CSCI 6511 Artificial Intelligence course project. This project mainly uses informed and uninformed search to find the shortest path in given graphs.
UCS, uniform cost search, is used to implement uninformed search.
A* algorithm is used to implement informed search.
Usage:
java -jar ShortestPath.jar <input file> <source vertex> <target vertex>
Example:
java -jar ShortestPath.jar ~/Downloads/graph.txt 123 666
Source vertex should not be the same with target vertex.