The algorithms included till now are:
1)A* search
2)IDA* search
3)Theta* search
4)Best First Search
5)Breadth-First Search
6)Dijkstra's algorithm
7)K Shortest Paths using Dijkstra's algorithm
An online demo can be seen here.
You can select an algorithm from the panel on the right side. There are also options available if you want to allow diagonal paths or not, or which heuristic function you want to use to calculate distance.
Algorithms A*, IDA*, Theta*, and K Shortest Paths run only for one destination. Best First Search, Breadth-First Search, and Dijkstra’s algorithm can be used for multiple destinations.
Obstacles can be added with mouse drag to make cells impenetrable. Choose if you want to add walls(obstacles) or more destinations using the radio button in the panel.
Also, algorithms can be compared using the compare algorithms button in the panel where you can see a graphical representation of the shortest path length returned by different algorithms and the number of operations each algorithm takes to return path.
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.