西安电子科技大学计算机学院算法分析与设计 Chapter24（2）.pdfVIP

Design and Analysis of Algorithms Shortest Paths II Reference: CLRS Chapter 24 Topics: • Bellman-Ford algorithm • DAG shortest paths • Linear programming and difference constraints • VLSI layout compaction Huo Hongwei 1 Negative-weight cycles • Recall: If a graph G = ( V, E) contains a negative-weight cycle, then some shortest paths may not exist. • Example: x 0 x u x x v Huo Hongwei