The time complexity of computing the transitive closure of binary relation on…
PYQ GATE 2005
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be
- A.
O(n)
- B.
O(n log n)
- C.
O(n 3/2)
- D.
O(n 3)
Attempted by 821 students.
Sign up free to check your answer
Sign up freeLoading lesson…