DAG source

Prove that a directed acyclic graph must have at least one source node.

Assume negation

Assume:

• Graph is directed and acyclic
• Graph does not have a source node

Show contradiction