All important Data Structures and Algorithms implemented in Python.
Algorithms used in Computer Science Courses and Projects
A Python-based Pac-Man game that uses Dijkstra's and A* algorithms to power intelligent ghost AI pathfinding. Built with Pygame, it features interactive gameplay and customizable grid-based maps.
This repository contains the implementation of classical graph based planning algorithms.
An interactive tool which visualizes path finding algorithms on a grid.
Le jeu de société Hex implementé en une application web utilisant le framework Flask.
Repository with algorithms implemented for learning purposes
Maze solving robot project
TU Dresden RoboLab Project. Python3, LEGO EV3
Graph library
A path finder program using Python to find the shortest walking distance between different buildings at Augustana University
Implementation of Dijkstra algorithm for robot path planning.
An interactive web application for shortest path and congestion-aware routing on city road networks using OpenStreetMap (OSM) data. Built with Streamlit, OSMnx, and NetworkX, the app uses a customized Dijkstra’s algorithm to compute optimal routes that consider simulated traffic congestion.
Interactive Streamlit simulator comparing Dijkstra routing with AI-based Q-Learning under network congestion.
implementation of several graph algorithms (dijkstra, prim, pagerank, bfs, etc) using airport & flights data
Add a description, image, and links to the dijkstra-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dijkstra-algorithm topic, visit your repo's landing page and select "manage topics."