graph algorithms figure the directed graph (againv known dv pv figure initial configuration of table used in dijkstra' algorithm known dv pv figure after is declared known the next vertex selected is at cost is the only adjacent vertexbut it is not adjustedbecause then is selectedand the distance for is adjusted down to the resulting table is depicted in figure nextv is selectedv gets updated down to the resulting table is figure