令l(v)? 令(1)S={v1},T=V-{v1,forv∈T W,ν){,吟∈E l()= otherwise (2)For SCV, T=v-S, suppose that these vertices of the shortest paths from vi to any vertices of s are in S. By Theorem 5.12(minver(v)=lVR, VKET), we gained the result which I(vR is the length of the shortest path from v, to vk(distance)o The vertex v is added to s (Let S=SUlk, T=T-VR, VET. Suppose that /(v) is the length of a shortest path from v, to v containing only vertices in S. Then /'(v)=min(l(v), l(vk)+w(vRv) (4Let S=S,T=T,l(v=l(v), goto(2)❖ l(v)? ❖ (1) S={v1 },T=V-{v1 },for vT (2)For SV, T=V-S, suppose that these vertices of the shortest paths from v1 to any vertices of S are in S. By Theorem 5.12(minvT{l(v)}=l(vk ), vkT), we gained the result which l(vk ) is the length of the shortest path from v1 to vk (distance)。The vertex vk is added to S. (3)Let S'=S∪{vk }, T'=T-{vk }, vT'. Suppose that l'(v) is the length of a shortest path from v1 to v containing only vertices in S'. Then l'(v)=min{l(v),l(vk )+w(vk ,v))} (4)Let S=S',T=T', l(v)=l'(v), goto (2)    +   = otherwise w v v v v E l v ( , ) { , } ( ) 1 1