Prove or disprove. A directed graph is a tree if and only if it is quasi-connected and

Question:

Prove or disprove. A directed graph is a tree if and only if it is quasi-connected and has no directed cycles.

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

Step by Step Answer:

Question Posted: