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

Explain how to find shortest and second shortest path in weighted graph represented as adjacency matrix using Dijkstra.

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

JavaScript book of Data structures