In the shortest paths problem, consider any algorithm in which $v.d,$ and $v.in$ a grapth are first initialized by calling Initialize$($G$,$ s$)[$s is the source$],$ and are only changed by calling Relax. Then, $v.d\backslash$delta $(s,v)$ for all vertices $v.$