Path-Finding Visualizer

Visit

A web-based tool to visualize various path-finding algorithms in action.

Table of Contents

• Introduction
• Features
• Demo
• Getting Started
  • Installation
• Algorithms
• License
• Contact

Introduction

Welcome to the Path-Finding Visualizer! This project allows users to interactively visualize popular path-finding algorithms on a grid, helping them understand the workings of algorithms like Dijkstra's, A*, DFS, and BFS.

Features

• Interactive Grid: Visualize the algorithm in action on an interactive grid.
• Multiple Algorithms: Choose from a variety of path-finding algorithms, including Dijkstra's, A*, BFS, and DFS.
• Real-time Metrics: View real-time metrics like execution time and visited cells during the algorithm's run.
• Adjustable Animation Speed: Customize the animation speed to suit your preference.
• Random Maze Generation: Quickly generate random mazes to test the algorithms on complex scenarios.
• Responsive Design: Enjoy a seamless experience on different devices with responsive design.

Demo

For a live demo, visit Path Finding Visualizer.

Getting Started

Installation

1. Clone the repository:

   git clone https://github.com/3mmarYasser/path-finding.git

2. Install the required packages:

   cd path-finding
   npm install

3. Start the development server:

    npm run dev

Algorithms

The visualizer supports various path-finding algorithms, including:

• Depth-First Search (DFS)
• Breadth-First Search (BFS)
• Dijkstra's Algorithm
• A Star Algorithm

Choose your preferred algorithm through the user interface and visualize how it navigates through the grid to find the shortest path.

License

This project is licensed under the MIT License - see the LICENSE file for details.

Contact

For any inquiries or suggestions, feel free to reach out:

• Email: ammar.yasseer.mohamed@gmail.com
• GitHub: 3mmarYasser
• LinkedIn: Ammar Yasser