Min Heap implementation for Dijkstra algorithm

Dijkstra’s algorithm is used to compute the shortest distance between two vertices in a graph. The psuedo code for the main part of Dijkstra’s algorithm is shown below:

An extremely fast implementation for Heap which can be used in