Exercises 22.3-12

Solution 1:
For each vertex v, construct DFS tree T rooted from v. Check whether T has forward or cross edge. If every T has no forward or cross edge, then G is singly connected.  Time complexity is O(V(V+E)).