Algorithms
Algorithms. Shortest Path Problems. G = (V, E) weighted directed graph w: E R weight function Weight of a path p = <v 0 , v 1 ,. . ., v n > Shortest path weight from u to v Shortest path from u to v: Any path from u to v with w(p) = (u,v) [v] predecessor of v on a path. .
897 views • 69 slides