A Python application designed for efficient pathfinding in graph-based city networks. Leveraging the Uniform Cost Search algorithm, a staple in AI for complex navigation and optimization problems, this tool calculates the shortest routes between cities with support for real-world geographic positioning through coordinate data.

A repository showcasing implementations of various algorithms, including graph algorithms (BFS, DFS, Dijkstra, Kruskal), dynamic programming solutions, and more. Designed for learning, practice, and demonstration of algorithmic problem-solving.