Compare A* with Dijkstra algorithm

The project contains the Java implementation of the A* and Dijkstra path search algorithms, which can be used alone in any application. A GUI demo is provided for the visualization that animates the search progress, also shows the cost of the path and the number of nodes visited during the search, so the difference between the two algorithm could not be more clear. http://plainaslife.blogspot.be/2015/02/compare-with-dijkstra-algorithm.html git clone https://github.com/kevinwang1975/PathFinder