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