卷別

資料結構與演算法(A)

選擇

國立臺灣大學 2022 · 考試 · 第 18 題

(5 points) When using Dijkstra's algorithm to solve the single-source shortest problem for a graph having $V$ vertices and $E$ edges, which is INCORRECT?

(A)
The search principle is breadth-first.
(B)
It is a greedy algorithm.
(C)
When using an array to implement the min-priority queue, the time complexity is $O(V^2)$ .
(D)
For a dense graph where $E = \Theta(V^2)$ , the algorithm can run in $O(V^2)$ when using the binary min-heap to implement the min-priority queue.
(E)
none of the other choices

標準解析

AI 生成