【題組】34. If Dijkstra algorithn is implemented with binary heap as priority queue, then the complexity
問題詳情
【題組】34. If Dijkstra algorithn is implemented with binary heap as priority queue, then the complexity is (A) O(|V|2+[IEl log|V|) (B) O(|V|2) (C) O(|E|log|V|) (D)O(|E|+|V|logIV|) (E) O(|E|)