Question: Given the following graph: A B D . E F Answer (5 points each): 1. Is it a Directed Acyclic Graph? Why? 2. Is it

Given the following graph: A B D . E F Answer (5 points each): 1. Is it a Directed Acyclic Graph? Why? 2. Is it strongly connected Why? 3. Is there a vertex where, if we started a Depth First Search there it would produce a forest and not just a single traversal tree? If there is such a vertex, what is it? Remember to number your answers and to write them in order
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
