35. If Dijkstra algorithm is implemented with doubly-linked Iist as prionity qucue, then the complexity is
(A) O(|V|²+1Ellog|V|)
(B) O(|V|²)
(C) O(|E|log|V|)
(D) O(|E|+|V| log|V|)
(E) O(|E|)

題目解析這道題目考察的是 Dijks...