Programming, Algorithms, Data, Tech, Web Development.
distance from the initial node to Y. Dijkstra’s algorithm will assign some initial distance values and will try to improve them step by step. Mark all nodes unvisited. Create a set of all the unvisited nodes called the unvisited set. Assign to every node a tentative distance value: set it to zero