Pathfinding application with the choice of A* and Dijkstras algorithms in addition to choosing the distance measurement. These measurements being Euclidian, Manhattan and Chebyshev or Tchebyshev.
Run:
javac *.java; java Application
Example of a path being found using A* algorithm using euclidian distance:
Example of a successful path below using the A* algorithm using chebyshev/tchebyshev distance:
Example of a path being found using Dijkstras algorithm using manhattan distance:
Example of it detecting when there is no path available
