In the ADT graph the methid addVertex has efficiency

Computers and Technology

1 answer:

sweet-ann [11.9K]2 years ago

6 0

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

You might be interested in

Administrative activities, such as archiving project files, closing out contracts, documenting lessons learned, and receiving fo

asambeis [7]

Answer:

closing

Explanation:

6 0

3 years ago

-Define three types of user mode to kernel mode transfers?

Ivahew [28]

Answer:

The three types of user mode to the kernel mode transferred occurred due to the:

It is mainly occurred due to the interrupt when, it send to the central processing unit (CPU).

It also occurs due to the hardware exception and when the memory is access illegally as it is divided by the zero.
It is mainly implemented or executed by the trap instruction as the system are basically executed by the program.

7 0

2 years ago

Is an applications program is a program designed to perform a specific task for specific users

Vika [28.1K]

Answer:

application software or tailored software

6 0

3 years ago

What is missing in this list of information needed to cite a book?

balandron [24]

Answer: