Let G = (V, E) be a directed acyclic graph in which there is a vertex

Question:

Let G = (V, E) be a directed acyclic graph in which there is a vertex ν0 ∈ V such that there exists a unique path from ν0 to every vertex ν ∈ V. Prove that the undirected version of G forms a tree.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: