Description of Algorithm:
Dijkstra algorithm is a single-source shortest path algorithm. Here, single-source means that only one source is given, and we have to find the shortest path from the source to all the nodes.
Dijkstra's algorithm allows us to find the shortest path between any two vertices of a graph.
It differs from the minimum spanning tree because the shortest distance between two vertices might not include all the vertices of the graph.
GitHub Repository: [ Ссылка ]
Tech Stack Used:
1. Python
2. pygame
3. tkinter
4. sys
