A Python implementation of Dijkstra's algorithm for finding the shortest paths between nodes in a weighted graph. This project was developed as part of an Optimization Techniques study to demonstrate computational logic and pathfinding efficiency.
The node map and distance weights calculated by the algorithm:
- Python 3
- Core Data Structures (Dictionaries, Lists, Lambda functions)