How to define Shortest Paths from Supply to all Vertices applying Dijkstra's Algorithm Provided a weighted graph and also a resource vertex in the graph, discover the shortest paths within the resource to all the other vertices while in the specified graph.The least range of vertices whose removal disconnects a graph is said to be the connectivity