+1 vote
in Data Structures & Algorithms I by (110k points)
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

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct option is (b) False

Best explanation: If such vertices exists it means that the graph contains a cycle which contradicts the first part of the statement.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.