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)
All Replies
Viewing 1 replies (of 1 total)
Viewing 1 replies (of 1 total)
- You must be logged in to reply to this topic.