Ask Question
14 May, 20:19

In the ADT graph the methid addVertex has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

+1
Answers (1)
  1. 14 May, 20:58
    0
    In ADT graph the efficiency of addVertex has efficiency O (logn).

    Explanation:

    The time complexity of the method addvertex in ADT graph is O (logn). addVertex method has time complexity of O (logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.

    hence we conclude that the answer is O (logn).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “In the ADT graph the methid addVertex has efficiency A. O (1) B. O (n) C. O (logn) D. O (n2) ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers