Cost Finding Algorithms for Graphs such as Shortest Path Algorithms (BellmanFord, Dijkstra, Floyd) and Minimum Spanning Tree Algorithms (Kruskal, Prims).

select graph type and settings

display graph

(back to top)

(back to top)

Before you begin, ensure you have met the following requirements:

• Python Make sure you have Python installed on your system. You can download and install Python from the official Python Website.

To install and run the program, follow these steps: Windows

1. Open Command Prompt.

2. Clone the repository:

   git clone https://github.com/InfiniteLoopify/graph-pathfinding-algorithms.git

3. Navigate to the project directory:

   cd graph-pathfinding-algorithms

4. Create a virtual environment and activate it:

   For Windows

   python -m venv venv    # create virtual environment
   venv\Scripts\activate  # activate virtual environment

   For Linux/MacOS

   python3 -m venv venv      # create virtual environment
   source venv/bin/activate  # activate virtual environment

5. Install dependencies:

   pip install -r requirements.txt

(back to top)

To use the program, follow these steps:

1. Make sure you have activated the virtual environment.
2. Run the program:

   python main.py

(back to top)

Distributed under the MIT License. See LICENSE for more information.

(back to top)

Umair Shahab - LinkedIn - umair.shahab.ahmed@gmail.com

Project Link: https://github.com/InfiniteLoopify/graph-pathfinding-algorithms

(back to top)