Pathfinding Visualizer is a web-based tool for visualizing various pathfinding algorithms. It allows users to draw walls and set start and end points to see how different algorithms find the shortest path.

• Visualize popular pathfinding algorithms like Dijkstra and A*.
• Interactive grid where users can create walls and move start/end points.
• Create any type of maze you want by clicking and dragging your mouse over the nodes.
• Real-time visualization of algorithm execution.

• Node.js
• npm (Node Package Manager)

• Draw Walls: Click and drag on the grid to create walls.
• Move Start/End Points: Click and drag the start (green) or end (red) nodes to reposition them.

1. Select Algorithm: Use the dropdown menu to select the pathfinding algorithm (Dijkstra, A* or BFS).
2. Run Algorithm: Click the "Visualize Algorithm" button to start the visualization.

• src/PathfindingVisualizer: Main visualizer component and related logic.
• src/algorithms: Pathfinding algorithm implementations.
• src/Node: Node component representing each grid cell.

1. Clone the repository:

   git clone https://github.com/yourusername/pathfinding-visualizer.git
   cd pathfinding-visualizer

2. Install the required dependencies:

   npm install

3. Start the development server:

   npm start

   The app will be available at http://localhost:3000.

• React
• Dijkstra's Algorithm
• A* Algorithm
• Breadth-First Search (BFS)