In the ADT graph the method clear has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

Question

Essence Fritz

Computers & Technology

22 November, 00:38

In the ADT graph the method clear has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)

+1

Answers (1)

Know the Answer?

Joyce · Answer 1

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.

In the ADT graph the method clear has efficiencyA. O (1)B. O (n)C. O (logn)D. O (n2)

In the ADT graph the method clear has efficiency

A. O (1)

B. O (n)

C. O (logn)

D. O (n2)