Shortest paths a shortest path from u to v is a path of minimum weight from u to v. The shortest- path weight from u to v is defined as S(u, v)=min((p): p is a path from u to v) Note: 8(u, v)=00 if no path from u to v exists c 2001 by Charles E Leiserson Introduction to Agorithms Day29L17.3© 2001 by Charles E. Leiserson Introduction to Algorithms Day 29 L17.3 Shortest paths A shortest path from u to v is a path of minimum weight from u to v. The shortest￾path weight from u to v is defined as δ(u, v) = min{w(p) : p is a path from u to v}. Note: δ(u, v) = ∞ if no path from u to v exists