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:
The time complexity of computing the transitive closure of a binary relation on a set of n elements is O(n^3) using the Floyd-Warshall algorithm.
Quiz of this Question
Please comment below if you find anything wrong in the above post