12
Edge Relaxation
Assume:
dist[]
and
pred[]
as above
(but containing data for shortest paths
discovered so far
)
Relaxation updates data for
w
if we find a shorter path from
s
to
w
.
![[prev]](icon/prev.gif){kind=icon}
12
![[next]](icon/next.gif){kind=icon}
![[Diagram:Pics/wgraphs/relaxation.png]](Pics/wgraphs/relaxation.png)