maddied5080 maddied5080
  • 23-08-2019
  • Computers and Technology
contestada

In the ADT graph the method clear has efficiency

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

Respuesta :

ExieFansler ExieFansler
  • 02-09-2019

Answer:

The efficiency of ADT graph method clear is option A.O(1)

Explanation:

The clear method in ADT graph is used to delete the graph from the memory or simply delete the graph.Since we just have to remove the all the vertices or we can say that we have to delete the container which contains the list of vertices which takes O(1) time we don't have to traverse over anything we can simply delete it in O(1) time.

Answer Link

Otras preguntas

Describe the path of the Rio Grande and what the river creates.
what is backhand drop shot and why is it used in badminton?
What is the relationship between a conjecture, a theorem, and a two column proof?
How do i do number 8
how to solve it I don't understand how too
Ab out how many african americans were elected to high public office during reconstruction
Help With my Math Question Will Give Brainest answer!!!
Janice"s mother gave her a $10 dollar bill to but 5 pounds each of bananas and apples at the grocery store. when she got there ,she found that bananas were 80 c
what is the purpose of a library walk
Explain how you can round 25.691 to the greatest place