title	description	author
Pathfinding Algorithm Visualizer	Visualize and compare various pathfinding algorithms with an interactive grid-based UI.	ParthAhuja143

About

Pathfinding algorithms are essential tools in various domains, from robotics to video games. This project aims to provide a visual representation of different pathfinding algorithms, allowing users to understand, compare, and analyze their behavior and performance. Whether you're a student learning about algorithms or a developer seeking to optimize your application's pathfinding capabilities, this visualizer can be a valuable educational and practical resource.

Features

• Interactive Grid-Based Interface: Define starting and ending points and add obstacles with an intuitive grid-based user interface.
• Real-Time Visualization: Witness the pathfinding process in real time as the algorithm navigates through the grid.
• Multiple Pathfinding Algorithms: Explore various pathfinding algorithms, including Dijkstra's Algorithm, A*, Breadth-First Search (BFS), Depth-First Search (DFS), Bidirectional BFS, Greedy Best-First Search, A*, and also a brand new Riot Algorithm.
• Convenience Features: Easily clear paths and obstacles with dedicated buttons.

Getting Started

Prerequisites

To run this project locally, you need to have Node.js installed on your machine. If you haven't already, you can download it from the official website.

Installation

Follow these steps to set up the project:

1. Clone this repository to your local machine:

   git clone https://github.com/ParthAhuja143/pathfinding-algorithm-visualizer.git
   

2. Install Dependencies

   npm install
   

3. Start the project

   npm start
   

4. The project will now be available on localhost:3000