How can I implement dijsktra's algorithm to find the shortest distance of the two vertices.

template double ShortestDistance(v& v1, V& v2)

C++ only.

SHORTEST PATHS: DIJKSTRA: Jijkstra(weightedgraph g, vertex firstv) for all vertices v currentD(v) = 0; currentD(firstv) = 0; toBeChecked = all vertices; while to BeChecked is not empty v = a vertex from to BeChecked with minimal D remove v from to BeChecked; for all vertices u adjacent to v and in to BeChecked if currentD(u) > currentD(v) + weight(edge vu) currentD(u) = currentD(v) + weight(edge vu) predecessor(u) = v; dijkstra will not always work properly with negative edge weights