# R Visual

> A pathfinding algorithm visualizer that animates BFS, DFS, Dijkstra's and A* search across a 2D grid so you can watch each algorithm work.

- Source: https://rao.dev/blog/rvisual
- Published: 2021-01-02
- Updated: 2024-11-15
- Tags: rvisual, dsa, algorithms, path-finding, dijkstra, astar, bfs, breadth-first-search, dfs, depth-first-search

---

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:

<Figure src={image1} alt="Welcome tutorial" />
<Figure src={image2} alt="Main grid interface" />
<Figure
	src={image3}
	alt="Solution showing the shortest path when obstacles are preset"
/>

I built this project when I was learning DSA (Data Structures & Algorithms) and
exploring some real life uses of these algorithms.