cs3460_ch9_shortest_path 美国高校《数据结构》（Data Structure），共9章 节 ，英文版.pptVIP

Shortest Path Algorithms - 1 The problem statement is simple An example with positive weights The shortest path from v1 to v6 is 1+4+1= 6 via v4 and v7 Notice this is not the least number of edges due to the weights Shortest Path Algorithms - 2 Negative weights introduce new problems If a cycle has a total path length that is negative, you can keep going around the cycle and drive the weight toward negative infinity Fortunately many applications only have positive weights, such as communications costs between network nodes, or at least do not have any negative cycles Shortest Path Algorithms -