Question: Consider the directed graph G on six vertices {A,B,C,D,E,F} given by the following adjacency list: A: B, F {i.e. there is an edge from A
Consider the directed graph G on six vertices {A,B,C,D,E,F} given by the following adjacency list:
A: B, F {i.e. there is an edge from A to B and from A to F} B: A, C, D C: A, B, D D: A, E E: D F: D, E
In a Depth-First-Search of G starting at node A, what is an order of finishing (i.e. coloring black) the vertices?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
