Conflict-based search for multi-agent path finding

Popular computer science algorithms implemented in Python

solving challenges from various problem sites like advent of code, leet code and others

Multi-agent shape formation using policy search

Implementação de estrutura e algoritmos estudados na disciplina de teoria dos grafos.

Desktop application of an implementation of Dijkstra's algorithm with custom GUI, can dynamically generate graphs if required.

Visualization of A* Search, Greedy BFS and Djikstra Search execution

Maximum Bandwidth Path problem is an important network optimization problem. The project compares the performance of different algorithms that solve the problem when applied to different types of networks.

Just what it sounds like, decorator that patches function bytecode to allow GOTO's *ROFL*

Jogo onde há um gato e um tabuleiro, em uma parte o gato precisa sair do tabuleiro, na outra o tabuleiro precisa capturar o gato.

Visualizing A* Pathing

This repo provides practical implementations of fundamental and advanced data structures and algorithms in Python. It includes clear and detailed examples across various categories, making it an essential resource for learning and applying key concepts in computer science.

Single Agent Pathfinding using Dijkstra's & A* algorithms

Graph Solution using Dijkstra

Contain source code using algorithm such sorting, searching and many more

🧩 Generating mazes with recursive backtracing.

school bus route optimization; collaboration with transport department

Simple search/sort code for arrays, linked lists, graphs