Dijkstra's Algorithm - Implementation in Python

Dijkstra’s Algorithm (Python) explained with a strong Italian accent. Enjoy.

[Algorithm’s brief description]
Dijkstra's algorithm is a way to find the shortest path between two points in a weighted directed graph (which might have cycles). All edges must have positive values.

[Dijkstra Algorithm’s applications]
Digital Mapping Services, Social Networking Applications

[Complete code]

[Software]
PyCharm by JetBrains

[Bibliography]