Directed Weighted Graph implementation in Python. This is the 4th assignment in OOP21 course in Ariel University.
-
Updated
Dec 26, 2021 - Python
Directed Weighted Graph implementation in Python. This is the 4th assignment in OOP21 course in Ariel University.
This is a program for finding the closest destinations from the source by applying Dijkstra's algorithm with an Adjacency List.
Add a description, image, and links to the single-source-shortest-path topic page so that developers can more easily learn about it.
To associate your repository with the single-source-shortest-path topic, visit your repo's landing page and select "manage topics."