4 Points Explain Vertex U Directed Graph End Depth First Tree Con Taining U Although U Inc Q37218149

a) (4 points) Explain how a vertex u of a directed graph can end up in a depth-first tree con- taining only u, although u has both incoming and outgoing edges. Solution: INSERT YOUR SOLUTION HERE (b) (4 points) Assume u is part of sonne directed cycle in G. Can u still end up all by itself in the depth-first forest of G? Justify your answer. (Hint: Recall the White Path

OR

 

OR