ISRO | ISRO CS 2017 – May | Question 78

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*log(n))

(B)

O(n^3/2)

(C)

O(n³)

(D)

O(n)

Answer: (C)

Explanation:

Transitive closure generally uses the Floyd-Warshall Algorithm which gives a time complexity of O(n³)

Refer: Transitive closure of a graph

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save