GATEverse
← GATE CSE 2005

Q7

MCQ1 mark, −0.25

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

Sign in to save attempts.

Loading…