Computer Science, asked by s180922, 23 hours ago

= , , , and R be the relation as
= { , , , , , , , , , , , , , (, , , , , , , , }.
Then find transitive closure of ?

Answers

Answered by pandhareopojas
0

Answer:

For example, if X is a set of airports and xRy means "there is a direct flight from airport x to airport y" (for x and y in X), then the transitive closure of R on X is the relation R+ such that x R+ y means "it is possible to fly from x to y in one or more flights".

Explanation:

hope it's correct buddy

Similar questions