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).
Answer:
comlleting novice-level certifications working on one
Answer:open source
Explanation: what is's called
Answer:
you can go to settings and try to fix it or contact the people of this website
Explanation: