Skip to content
Related Articles
Open in App
Not now

Related Articles

ISRO | ISRO CS 2017 – May | Question 78

Improve Article
Save Article
  • Last Updated : 21 Mar, 2018
Improve Article
Save Article

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









Answer: (C)


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

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
Related Articles

Start Your Coding Journey Now!