The time complexity of computing the transitive closure of a binary relation

The time complexity of computing the transitive closure of a binary relation on a set of nn elements is known to be

a. O(nlogn)O(nlog⁡n)

b. O(n3/2)O(n3/2)

c. O(n3)O(n3)

d. O(n)

1Comment
shivani @shivani1234
20 May 2017 08:30 pm

transitive closure can be found by Floyd Warshall's algorithm in O(n3)