Vidyalelo
Data Structure · Q75

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 75

Q75

What is the formula to compute the transitive closure of a graph?

A.
tij(k) = tij(k-1) AND (tik(k-1) OR tkj(k-1))
B.
tij(k) = tij(k-1) OR (tik(k-1) AND tkj(k-1))
Answer
C.
tij(k) = tij(k-1) AND (tik(k-1) AND tkj(k-1))
D.
tij(k) = tij(k-1) OR (tik(k-1) OR tkj(k-1))

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board