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


Answer: (C)

Explanation: Transitive closure generally uses Floyd-Warshall Algorithm which gives a time complexity of O(n³)
Refer: Transitive closure of a graph

Quiz of this Question

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.