Apply Dijkstra algorithm to complete the distance and predecessor tabiat node A 1 -D E 1 3 1 3 5 1 - B 5 Note: As long as the solution valid for an iteration, you should copy it to the following iterations (don't leave any empty.cell) DIO DD) PYC PYDPE Iteration Newly added node to NB 0 . DIE . yel + A 1 . + + + . 2 + + 3 . + + 4 + +