【題組】33. If Dijkstra algorithm is implemented with Fibonacci heap as priority queue, then the complex
問題詳情
【題組】
33. If Dijkstra algorithm is implemented with Fibonacci 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|+I|V| log(|V|) (E) O(|E|)