Skip to content

Visualization of how Dijsktra's shortest path finding algorithm works in an hexagonal grid, with a playable component :)

Notifications You must be signed in to change notification settings

mberkturgut/Dijsktra-Path-Finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
Jan 20, 2024
Mar 31, 2023
Mar 31, 2023

Repository files navigation

Path Finding with Djsktra's Algorithm

This demo is a project me and my partner developed under BogaziciAI. In this project we wanted to visualize how path finding algorithms work. To that end, we initially created game.py, which is a playground that you can move in a hexagonal grid with QWE and ASD keys. The purpose is to reach the blue circle to the read circle.

image

Afterwards, we introduced barriers to the grid, and implemented dijkstra's algorithm which seeks the shortest path to the target in the following manner.

image

If you liked our project or have a feedback feel free to reach out to me via Linkedin

About

Visualization of how Dijsktra's shortest path finding algorithm works in an hexagonal grid, with a playable component :)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages