Dijkstra’s Algorithm

Dijkstra’s algorithm implements the greedy approach [86] in solving the single source shortest problem by repeatedly choosing the unselected vertices, vertex ? nearest to sources ? and initialize its distance as the actual shortest distance from ? to ?. Then, the edges of ? are checked to ensure the feasibility of the computed path to the destination. This algorithm has a very low computational cost due to its ability to access only the non-negative edges.