单选题：Worst case is the worst case time complexity of Prim’s algorithm

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?


@[B](2)

A. O(log V)
B. O(V^2)
C. O(E^2)
D. O(V log E)



A.O(log V)
B.O(V^2)
C.O(E^2)
D.O(V log E)


答案：B