known dv pv figure after is declared known known dv pv figure after is declared known known dv pv figure after and then are declared known finallyv is selected the final table is shown in figure figure graphically shows how edges are marked known and vertices updated during dijkstra' algorithm to print out the actual path from start vertex to some vertex vwe can write recursive routine to follow the trail left in the variables we now give pseudocode to implement dijkstra' algorithm each vertex stores various data members that are used in the algorithm this is shown in figure