R Visual

View page
View as MarkdownView this page as plain textLLMs fullSee the entire site as markdown for LLMsOpen in ClaudeAsk questions about this pageOpen in ChatGPTAsk questions about this page

· 1 min read · updated

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:

Welcome tutorial
Main grid interface
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.