7. If Dijkstra algorithm is implemented with Binomial heap as priority qucue, then the complexity is mplexity is
(A)O(IVI²+E log IVI)
(B)O(IVI²)
(C)O(IEl log IVI)
(D)O(|E|+|V| log|V|)
(E) O(|E|)

答案：登入後查看
統計： 尚無統計資料