原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
CREASE-KEY operation takes O(lg V) time, and there are still at most |E| such operations.
The total running time is therefore O((V + E) lg V), which is O(E lg V) in the typical case that |E| = Ω(V). This running time improves upon the straightforward O(V2)-time implementation if E = o(V2/lg V
). By implementing the min-priority queue with a Fibonacci heap (see page 478), you can im
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea