Skip to content

Latest commit

 

History

History
50 lines (34 loc) · 1.8 KB

README.md

File metadata and controls

50 lines (34 loc) · 1.8 KB

Dijkstra's Algorithm Visualization

This React application demonstrates the visualization of Dijkstra's algorithm on a grid. The algorithm finds the shortest path from a start node to a finish node, considering walls as obstacles.

Getting Started

To run the project locally, follow these steps:

  1. Clone the Repository:

    git clone https://github.com/your-username/dijkstra-visualization.git
cd dijkstra-visualization

  2. Install Dependencies:

    npm install

  3. Run the Application:

    npm install
npm start

The application should open in your default web browser at http://localhost:3000.

Screenshot 2023-12-15 at 11 08 36 PM Screenshot 2023-12-15 at 11 08 44 PM Screenshot 2023-12-15 at 11 08 48 PM

Usage

  • Click the "Visualize Dijkstra" button to see the algorithm in action.
  • Observe the visualization of the algorithm's progress on the grid.
  • The shortest path from the start node to the finish node will be marked in blue.

Folder Structure

  • src/components/Grid.js: Contains the main grid component.
  • src/components/Node.js: Represents a single node in the grid.
  • styled-components: Styling using the styled-components library.

Dependencies

  • React
  • styled-components

License

This project is licensed under the GPL-3.0 license - see the LICENSE file for details.

Author

Mohammed M. Salha