any time the shortest distance of node is replaced by lesser valuewe need to update the previous node column too at the end of the first stepour table looks as followsnode shortest distance from source previous node none none none at this pointnode is considered visited as suchwe add node to the list of visited nodes in the tablewe show that node has been visited by making the text bold and appending an asterisk sign to it in the second stepwe find the node with the shortest distance using our table as guide node with its value has the shortest distance this is what we can infer from the table about node to get to node ewe must visit node and cover distance of from node awe cover distance of to get to the starting nodewhich is node itself the adjacent nodes of node are and but node has already been visitedso we only consider node to find the shortest route or distance to node fwe must find the distance from the starting node to node and add it to the distance between node and we can find the distance from the starting node to node by looking at the shortest distance column of node ewhich has the value the distance from node to can be obtained from the adjacency list we developed in python earlier in this section this distance is these two sum up to which is less than infinity remember we are on examining the adjacent node since there are more adjacent nodes of node ewe mark node as visited our updated table will have the following values