How to define Shortest Paths from Supply to all Vertices using Dijkstra's Algorithm Provided a weighted graph plus a resource vertex during the graph, find the shortest paths in the supply to all the opposite vertices during the given graph.A graph is, at least, weakly connected when There is certainly an undirected path (disregarding the direction