原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
Dijkstra’s algorithm depends on the specific implementation of the min-priority queue Q.
A simple implementation takes advantage of the vertices being numbered 1 to |V|: simply store v.d in the vth entry of an array. Each INSERT and DECREASE-KEY operation takes O(1) time, and each EXTRACT-MIN
operation takes O(V) time (since it has to search through the entire array), for a total
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea