Chapter4NetworkLayer培训课件.pptVIP

Dijsktra算法 1 Initialization: 2 N’ = {u} // N’为已找到最短路径的节点集合，初始时只有u 3 for all nodes v //标记源节点u到各个节点v的路径代价D(v) 4 if v adjacent to u 5 then D(v) = c(u,v) //c(u,v)为链路(u,v)的代价 6 else D(v) = ∞ 7 8 Loop 9 find w not in N’ such that D(w) is a minimum //下一条最短路径 10 add w to N’ //将找到最短路径的节点加入N’ 11 update D(v) for all v adjacent to w and not in N’ : 12 D(v) = min( D(v), D(w) + c(w,v) ) //更新到相关节点的路径代价 13 until all nodes in N Dijkstra算法举例 Step 0 1 2 3 4 5 N u ux uxy uxyv uxyvw uxyvwz D(v),p(v) 2,u 2,u 2,u D(w),p(w) 5,u 4,x 3,y 3,y D(x),p(x