GanapathyPT/Short-Path-Finder

Application to find short distance between two points using Dijkstra's algorithm

Short-Path-Finder

-- Application to find short distance between two points using Dijkstra's algorithm

Requirements

make sure python is installed on your computer

python --version
Python 3.6.9

check the same for pip

pip --version
pip 20.3.3

install pygame module using pip (python package installer)

pip install pygame

usage

clone the project and change the directory

git clone https://github.com/GanapathyPT/Short-Path-Finder.git

cd ./Short-Path-Finder

now execute the main file using python

python main.py

Rules

1. Click any block to make it as Start Block
2. Click another block to make it as End Block
3. Make the Barriers by dragging the block of codes
4. Click on specific button mentioned below once you done drawing the barriers
5. Click on SPACE to use dijkstra's algorithm
6. Click on ENTER to use the A* algorithm
7. wait untill the Algorithm finds the path
8. Click on any button to start again