Final project of Data Structures and Algorithms course at AUT.

🌟最短路径相关算法的可视化

CS4310

Query evaluation code for SERPENT

Packman eat fruits in the shorest path

This project is a map analyzer that finds the fastest route between two points using Dijkstra's algorithm and analyzes the map's road network. It can also generate a barely connected map using a minimum spanning tree approach.

Solution à l'exercice Le Labyrinthe proposé par la plateforme Codingame.

Autonomous Computer-Controlled Game Characters

Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)

Test out your path finding algorithms with other bots.