Algorithms used in Computer Science Courses and Projects
All important Data Structures and Algorithms implemented in Python.
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
implementation of several graph algorithms (dijkstra, prim, pagerank, bfs, etc) using airport & flights data
Labyrinthe with Tkinter.
Artificial Intelligence final project. implementing negamax.
Assignment work from my 'Algorithms and data structures' (FIT2004) computer science class at university
A pathfinder software made for UK, London subway system using various algorithms. Made for COMPSCI 2XC3 group project.
A tool for visualizing pathfinding algorithms, allowing users to create mazes and watch their solution using popular algorithms such as DFS, BFS, Dijkstra, and A*.
Python program to compute the shortest path between Indian state capitals using Single Source Shortest Path (SSSP) Algorithm. Fetched distance data from Google Maps, to find the optimal path.
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."