Skip to content
Related Articles

Related Articles

Data Structures | Graph | Question 3
  • Last Updated : 11 Feb, 2013

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be:
(A) O(n)
(B) O(nLogn)
(C) O(n ^ (3/2))
(D) O(n^3)

Answer: (D)

Explanation: See question 3 of

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :