Shortest Path Faster Algorithm

Given a directed weighted graph with V vertices, E edges and a source vertex S. The task is to find the shortest path from the source vertex to all other vertices in the given graph.

Reference

• https://www.geeksforgeeks.org/shortest-path-faster-algorithm/