Min Heap implementation for Dijkstra algorithm

Dijkstra’s algorithm┬ácomputes the shortest distance between two vertices in a graph. Vertices in a graph are connected by an edge with a positive length.

An extremely fast implementation for Heap which can be used in Dijkstra’s algorithm is shown