Skip to content

A simple interactive visualizer with a PyGame GUI that allows users to input custom coordinates on a grid, with optional barriers, to demonstrate how the 'A-Star' algorithm finds the shortest path between two nodes.

Notifications You must be signed in to change notification settings

mcmorriss/A-Shortest-Path-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 

Repository files navigation

A* Shortest Path Interactive Visualizer

This progam uses a pygame GUI to allow a user to set two points, a starting and an ending points, and create optional barriers between them that allows the user to view an interesting representation of how the A* algorithm finds the shortest path between two nodes.

There are several controls for the user such as:

Left click = create a start, end, and a barrier node.
Right click = deletes/erases the nodes from the grid.
Enter button = executes the algorithm with set nodes.

Here is a demo of the program performing the algorithm with 3 different placements:

2022-09-16.20-59-03.mp4

Link: A-star algorithm python implementation (https://medium.com/@nicholas.w.swift/easy-a-star-pathfinding-7e6689c7f7b2)

About

A simple interactive visualizer with a PyGame GUI that allows users to input custom coordinates on a grid, with optional barriers, to demonstrate how the 'A-Star' algorithm finds the shortest path between two nodes.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages