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?

Category: QuestionsFor any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
Editor">Editor Staff asked 2 months ago

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 Answers
Editor">Editor Staff answered 2 months ago

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.