Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What is the transitive closure of the relation R = {(1, 2), (2, 3)}?
Think of the pairs that need to be added to ensure transitivity.
Which property must be satisfied for a relation to be a transitive closure?
If A is related to B and B is related to C, what must also be true?
What is the transitive closure of a relation?
Remember the goal is to ensure A relates to C if A relates to B and B to C.
True or False: The transitive closure can be computed in a single step.
Think back to our example!
You have a relation R = {(1, 2), (2, 3), (4, 5)}. Find R's transitive closure and explain the steps taken.
Look at pairs and see if they indirectly relate to each other.
Given the relation R = {(a, b), (b, c), (c, d), (d, a)}, calculate its transitive closure.
Consider how far each node can reach through others.
5 more questions in this section. Enroll free to practise them all.
Enroll free