Vidyalelo
Data Structure · Q52

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 52

Q52

The time taken to compute the transitive closure of a graph is Theta(n2).

A.
True
B.
False
Answer

Answer: Option B

Solution

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