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.