The time complexity to find shortest distances by using Dijkstra’s

1.	The time complexity to find shortest distances by using Dijkstra’s algorithm is __________
A.	O(E2)
B.	O(V+1-E)
C.	O(V+E)
D.	O(E+VlogV)
Answer» E.

Discussion