The Shortest Path Problem a At each step,we select a vertex ve ywith minimum 1 and move it to x,and a of each vertex we ythat is adjacent to yis updated indicating that a shorter path to wvia yhas been discovered. VwEY and (y,w)EE,[w]=min(w],y]+length(y,w) The above process is repeated until Yis empty. Finally,1 of each vertex in Xis the distance from the source vertex to this one.The Shortest Path Problem ◼ At each step, we select a vertex yY with minimum  and move it to X, and  of each vertex wY that is adjacent to y is updated indicating that a shorter path to w via y has been discovered.    = + w Y y w E w w y y w and , , [ ] min [ ], [ ] length , ( )     ( ) ◼ The above process is repeated until Y is empty. ◼ Finally,  of each vertex in X is the distance from the source vertex to this one