Dijkstras algorithm Assume all edges are non-negative. Idea: Greedily relax out arcs of minimum cost nodes y Q=s,u, v, x,yl Vertices to relax Vertices with shortest path value a williams, Spning 03 Dijkstras algorithm Assume all edges are non-negative Idea: Greedily relax out arcs of minimum cost nodes 46 Q=x,y, u, v) Vertices to relax Vertices with shortest path value ian williams, Spring 03Dijkstra’s Algorithm Assume all edges are non-negative. Idea: Greedily relax out arcs of minimum cost nodes u v 1 10 ’ ’ 9 0 2 3 4 6 s 7 5 ’ ’ 2 x y Q = {s,u,v,x,y} Vertices to relax S = {} Vertices with shortest path value Brian Williams, Spring 03 15 Dijkstra’s Algorithm Assume all edges are non-negative. Idea: Greedily relax out arcs of minimum cost nodes u v 1 10 ’ ’ 9 2 3 4 6 s 0 7 5 ’ ’ 2 x y Q = {x,y,u,v} Vertices to relax S = {s} Vertices with shortest path value Brian Williams, Spring 03 16