Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Under what condition does a directed acyclic graph (DAG) have a unique topological ordering?
When the graph has a single source and a single sink
None of these
When every vertex has exactly one incoming edge
When no two vertices have the same in-degree
When the graph is weakly connected
When the DAG has a Hamiltonian path
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!