graph algorithms known dv pv figure the table after is declared known selected is every vertex is adjacent to is not examinedbecause it is known is unchangedbecause it has dv and the edge cost from to is all the rest are updated figure shows the resulting table the next vertex chosen is (arbitrarily breaking tiethis does not affect any distances then is chosenwhich affects the distance in producing figure figure results from the selection of which forces and to be adjusted and then are selectedcompleting the algorithm known dv pv figure the table after and then are declared known known dv pv figure the table after is declared known