In the adt graph the methid addvertex has efficiency
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)

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).

answer; ///i do believe that the correct answer is (condition and action); /

ok i will be on the look out for blahblahthisisfakeah