0 votes 0 votes The time complexity of computing the transitive closure of binary relation on set of n element is known to be:- Algorithms algorithms gatecse-2005 time-complexity + – Ketan Dhakate asked Jun 6, 2017 retagged Jun 25, 2022 by makhdoom ghaya Ketan Dhakate 637 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Warshall’s algorithm can be used to construct the Transitive closure of directed graphs () so O(n3) https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm http://en.wikipedia.org/wiki/Transitive_closure pawan kumarln answered Jun 7, 2017 pawan kumarln comment Share Follow See all 0 reply Please log in or register to add a comment.