Abstract: The single source shortest path is a problem which consists of finding shortest path between a particular node and all the other nodes present in the graph. The Dijkstra’s algorithm is used ...