Python coding question - find shortest and 2nd shortest path using Dijkstra

Explain how to apply Dijkstra to find shortest path and second shortest path in a weighted graph represented as adjacency matrix. Code in Python.

Note: this is the revisit of Java coding interview question - find shortest and second shortest path using Dijkstra. I have enhanced the code and video so that it is easy to understand.

Code

Python book of data structures