Answer:
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).
The answer is D. Electoral College
Fed jig. defect bhds. if. bugs. bffs. hex.
I would tell said individual to stop what they’re trying to tell me because if it’s not stuff I should know about or want to hear about then I don’t wanna hear any of it
