Q71
The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is . . . . . . . .
A.
O(V)
B.
O(E2)
C.
O(E)
D.
O(V2)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board