A directed graph G = (V, E) is singly connected if u implies that G

A directed graph G = (V, E) is singly connected if u ⤳ ν implies that G contains at most one simple path from u to ν for all vertices u, ν ∈ V. Give an efficient algorithm to determine whether or not a directed graph is singly connected.