Weighted graphs and Path Lengths 7 graph h G=<VE> Weight function :E→9 Path p=< Path weight (p)=∑w(v;12V1) Shortest path weight b(u, v)=min w(p): u-Pv)else oou v 1 x y 2 10 5 7 9 2 3 4 6 s Weighted Graphs and Path Lengths Graph G = <V, E> Weight function w: E →ℜ Path p = < vo, v1, … vk > Path weight w(p) = Σ w(vi-1,vi) Shortest path weight δ(u,v) = min {w(p) : u →p v } else ∞