Path Visualizer

Path Visualizerr is a web application designed to provide efficient simulation solutions using HTML, CSS, and JavaScript. The core functionality of this project is based on Dijkstra's algorithm, which enables the determination of the shortest distance between two points on a grid .

Visit The webpage

https://shashankhl-pathvisualizer.netlify.app/

Features

• User-Friendly Interface: The web application offers an intuitive and user-friendly interface, making it easy for users to input their starting and destination points.

• Interactive Grid: The interactive Grid displays the available routes between the selected points, highlighting the shortest path using Dijkstra's algorithm.

• Shortest Distance Calculation: path visualizer utilizes Dijkstra's algorithm to calculate and display the shortest distance between the chosen points, ensuring efficient route planning.

• Visual Representation: The application visually represents the recommended route, making it convenient for users to follow the path and reach the finish point.

How It Works

1. Input Obstacles: Enter your obstacle point in the provided fields on the web application.

2. Algorithm Processing: The application processes your input using Dijkstra's algorithm to determine the shortest route between the two points.

3. Route Visualization: The recommended route is then displayed on the interactive grid, showing each step of the process.

4. Distance Calculation: GPS Navigator calculates and presents the exact distance between the chosen locations, helping you plan your travel time accurately.

Technologies Used

• HTML: Provides the structure and layout of the web page.
• CSS: Enhances the visual appeal and styling of the application.
• JavaScript: Implements the Dijkstra's algorithm for route calculation and map interaction.

Installation and Usage

1. Clone the repository to your local machine using the following command:

   git clone https://github.com/shashankhl/Path_Visualizer_DSA.git
   

2. Navigate to the project directory and open the index.html file in your web browser.

3. Input your starting and destination locations to calculate the shortest route using Dijkstra's algorithm.

Contribution

Contributions to this project are welcome! If you'd like to improve the application, fix bugs, or add new features, please follow these steps:

1. Fork the repository.

2. Create a new branch for your feature or bug fix:

   git checkout -b feature/your-feature-name
   

3. Make your modifications and commit changes:

   git commit -m "Add your commit message here"
   

4. Push your changes to your forked repository:

   git push origin feature/your-feature-name
   

5. Create a pull request on the main repository's main branch.

The Pathfinding Visualizer Algorithm, powered by Dijkstra's algorithm, systematically explores and evaluates routes to find the shortest path between a starting point and destination. Through visual representation and user-friendly interaction, it offers efficient route planning and navigation for users, ensuring they reach their destinations quickly and reliably.