原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
fice (see Exercise 22.1-3), which is why we say O(V2+VE) time, rather than Θ(V2+VE) time.
In the frequent case where |E| = Ω(V), we can express this running time as O(VE). Exercise 22.1-5 asks you to make the Bellman-Ford algorithm run in O(VE) time even when |E| = o(V). To prove the correctness of the
Bellman-Ford algorithm, we start by showing that if there are no negative-weight cycles,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea