Single source shortest path
About the algorithm:
The shortest path algorithm is about finding a path between 2 vertices in a graph such that the total sum of the edge weights is minimum
Time Complexity:O(ELogV)
Here's the graph we will be using to find the shortest path
