33. If Dijkstra algorithm is implemented with Fibonacci heap as priority queue, then the complexity is
(A) O(|V|²+|E| log |V|)
(B) O(|V|²)
(C) O(|E| log|V|)
(D) O(|E|+I|V| log(|V|)
(E) O(|E|)

相關試題

相關試卷