9. If Dijkstra algorithm is implemented with binary heap as priority queue, then the complexity is (
問題詳情
9. If Dijkstra algorithm is implemented with binary heap as priority queue, then the complexity is (A)O(|V|2+|E|log|V|) (B)O(|V|2) (C)O(|E| log |V|) (D)O(|E|+|V|Iog|V|) (E)O(|E|)