R Visual

A pathfinding algorithm seeks to find the shortest path between two points. This application visualizes various pathfinding algorithms in action, and more...

R Visual supports 4 algorithms: Breadth first search (BFS), Depth first search (DFS), Dijkstra's and A* search algorithm. It lets the user choose a start point and end point in a 2D grid array and also lets the user add multiple obstacles in the path. It uses the selected algorithm to find a path from the start point to the end point. The user can trace the path that the algorithm is following to learn more about how the algorithm works.

Here are a few screenshots from R Visual: