Skip to content
A* search algorithm that finds the shortest path through a maze. CMSC262 Lab 3
Java Makefile
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
test
AStar.java
Coord.java
Dijkstra.java
Makefile
README

README

To compile, run "make"

To run, run "java AStar [option] <file> <arguments>"

Options
   -v   verbose - prints all steps of the search (NOT IMPLEMENTED)

Arguments
   manhattan OR m   use Manhattan distance for heuristic
   euclidean OR e   use Euclidean distance for heuristic
  
Program prints a map of the final state, indicating visited spaces with '-' and
final path with '*', as well as the path as a list of points and the length
You can’t perform that action at this time.