1.

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

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.



Discussion

No Comment Found

Related InterviewSolutions