Walks are any sequence of nodes and edges inside a graph. In cases like this, equally nodes and edges can repeat from the sequence.How to define Shortest Paths from Supply to all Vertices using Dijkstra's Algorithm Given a weighted graph as well as a supply vertex from the graph, locate the shortest paths within the source to all the other vertices