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).
Books,well trusted websites , news.reports , schools library (online and off ) hope this helps.:-)
Answer:
You could just go to social medIa to say j.o.i.n z.o.o.m not brainly mate
You Need Software To Screen Capture
The Software You can use is OBS its free and there are watermarks