The time required to find shortest path in a graph with n vertices and e edges is:
A. O(e)
B. O(n)
C. O(e2)
D. O(n2)
Answer:D
The time required to find shortest path in a graph with n vertices and e edges is:
A. O(e) B. O(n) C. O(e2) D. O(n2)