Implementation of Dijkstra's shortest path algorithm in python. a greedy algorithm for finding the shortest path from a specific source node to any other target node in a weighted graph
Shortest path from node s to e:
s --> a --> d --> e
total cost of the path: 4