Q151
For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
A.
True
B.
False
AnswerAnswer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board