So, the original implementations of Dijsktra's algorithm used an unordered array, Which would mean that it would take time proportional to V to find the minimum, To find the vertex closest to the source. 