A transitive closure of a binary relation \(R\) on a set \(X\) is the transitive relation \(R^{+}\) on set \(X\) such that \(R^{+}\) contains \(R\) and \(R^{+}\) is minimal.

What is the time complexity of computing the transitive closure of a binary relation on a set of \(n\) elements?

×

Problem Loading...

Note Loading...

Set Loading...