10. If Dijkstra algorithm is implemented with doubly-linked list as priority qucue, then the complex
問題詳情
10. If Dijkstra algorithm is implemented with doubly-linked list as priority qucue, then the complexity is (A)O(|V|2+|E|log|V|) (B)O(|V|2) (C) O|E| log|V|) (D)O(|E|+|V|(log|V|) (E) O(|E|)