The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be
Explanation: Transitive closure generally uses Floyd-Warshall Algorithm which gives a time complexity of O(n3)
Refer: Transitive closure of a graph
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.