What is correct about statements S1 and S2?

Question

$S1$: The depth of a breadth-first search tree on an undirected graph $G = (V, E)$ from an arbitrary vertex $v \in V$ is the diameter of the graph $G$. (The diameter $d$ of a graph is the smallest $d$ such that every pair of vertices $s$ and $t$ have $\delta(s, t) \leq d.)$

$S2$: Every directed acyclic graph has exactly one topological ordering.

What is correct about statements $S1$ and $S2$?

• A. False, False
• B. False, True
• C. True, False
• D. True,True

Comments

S2 is false

Answer 1

Both are False