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

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.

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

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

Graph Solution using Dijkstra

Conflict-based search for multi-agent path finding

Multi-agent shape formation using policy search

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

Dijkstra shortest path solving with Python 3.8.1 / NetworkX / Matplotlib

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

GUI application to find shortest path between points in a graph using Djikstra's algorithm.

Python Parcel Delivery using Djikstra's Shortest Path and basic user CLI to search

🧩 Generating mazes with recursive backtracing.

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

Popular computer science algorithms implemented in Python

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

Single Agent Pathfinding using Dijkstra's & A* algorithms