Dijkstra's algorithm is one of the standard algorithms for solving the SSSP problem, in which we are required to find the length of the shortest paths from a source node $$s$$ to all other nodes in the graph. The algorithm constructs a shortest path tree, from which the shortest paths can be recovered.