算法分析与设计2004春.课件.第08讲【荐】.pdfVIP

Lecture 8. shortest-paths Background To find a shortest route from one city to another To find a least time route from one place to the others 工作流中的最短完成时间？ Any more? 清华大学宋斌恒 1 Description of the problem Weighted Directed Graph Weight function: w: ER Path p=v ,v ,v ,…,v 0 1 2 k Weight of a path: k w(p ) ∑w(v −1,v ) i i i 1 Shortest path weight from u to v by:  p min{w(p )} : u → v if there is a path from u to v δ (u,v)   ∞ otherwise 清华大学宋斌恒 2 Problem and its variants Single-Source shortest-path Single-Destination shortest-path Single-pair shortest-path All-pairs shortest-paths 清华大学宋斌恒 3 Optimal substructure of a shortest path Shortest-paths algorithms typically rely on the property that a shortest path between two vertices contains other shortest paths within it. Conditions for applying the Dynamic programming and greedy method: Optimal substructure. 清华大学宋斌恒 4 Lemma 24.1. Subpaths of shortest paths are shortest paths Proof. Using method of cut and patse 清华大学宋斌恒 5 Negative weight edges Most of the instance of the problems are all of the edges are nonnegative weight Some of the instance of the problems ha