A Dijkstra algorithm contains:

A graph

A source (I want to find the shortest path(es) from this point to that point for all the other points)

A distance array (this is where I store the results of "from point source to point A, the distance is 12".

A heap