Skip to content

Shortest Path Visualizer with GUI. The algorithm used is a BFS, which guarantees the shortest path from the start point to the end. You can build obstacles, and if the path betweens the two points exists, the algorithm will find it.

Notifications You must be signed in to change notification settings

andrei811/Shortest-Path-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Shortest-Path-Visualizer

img

The visualizations shows how the shortest path can be find using a BFS algorithm. The program uses tkinter for a GUI window such that you are able to give some input (the start and end points) and pygame for the animation. It can be used in learning purposes.

Run the visualization

Make sure that you have installed all the needed libraries. Open terminal and make sure that your working directory is ./Shortest-Path-Visualizer/Path Visualization/. Then execute the following command:

python Path_Visualization.py

About

Shortest Path Visualizer with GUI. The algorithm used is a BFS, which guarantees the shortest path from the start point to the end. You can build obstacles, and if the path betweens the two points exists, the algorithm will find it.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages