This project implements Dijkstra's Algorithm for finding the shortest paths in a weighted graph with non-negative weights. The implementation uses Python with Tkinter for the GUI, NetworkX for graph ...