... neighbor(u) v ∉T update(u,v) ; Until T = V 34 Dijkstra’s algorithm: Ví d Step T u ux uxy uxyv uxyvw uxyvwz d(v),p(v) d(w),p(w) 2,u 5,u 2,u 4,x 2,u 3,y 3,y d(x),p(x) 1,u d(y),p(y) ∞ 2,x d(z),p(z) ... dx(y) = {c(x,v) + dv(y) } v cho t t c v hàng xóm c a x 36 Minh h a Bellman-Ford Eq D th y, dv(z) = 5, dx(z) = 3, dw(z) = B-F eq cho ta bi t: u v x w z y du(z) = { c(u,v) + dv(z), c(u,x) + dx(z), ... u: z y destination v v x w u z x y SPT c a u: link (u,v) (u,x) y (u,x) w (u,x) z 35 (u,x) Gi i thu t d ng distance-vector (1 ) Phương trình Bellman-Ford (quy hoach ñ ng) ð nh nghĩa dx(y) := chi...