DAG - Directed Acyclic Graph

TL’DR : in a DAG, a mutually unreachable pair (s, t) can exist if and only if there exists at least one topological level with at least two nodes. An interesting question came during the Course COMP-5