In the ADT graph the methid addVertex has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

Question

Tripp Simpson

Computers & Technology

2 October, 16:19

In the ADT graph the methid addVertex has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

+4

Answers (1)

Know the Answer?

Tristian Barker · Answer 1

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

In the ADT graph the methid addVertex has efficiencyA. O (1)B. O (n)C. O (logn)D. O (n2)

In the ADT graph the methid addVertex has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)