Question

Problem 1. (a) Run BFS algorithm on the directed graph below, using vertex A as the source. Show all distances and the BFS tree. (b) Run DFS algorithm on the directed graph below, using vertex A as the source. Compute the start time and the finish time of each vertex and draw the DFS tree. Start time of a vertex would be when you first visit it and the finish time, when you visit that last (i.e., you have already explored all the descendants of that vertex). Time for the source starts at 1 and increments by 1 when you visit a vertex. Note: You may assume that the vertices in each adjacency list is in alphabetical order.

          Problem 1. (a) Run BFS algorithm on the directed graph below, using vertex A as the source.
Show all distances and the BFS tree.
(b) Run DFS algorithm on the directed graph below, using vertex A as the source. Compute
the start time and the finish time of each vertex and draw the DFS tree. Start time of a
vertex would be when you first visit it and the finish time, when you visit that last (i.e.,
you have already explored all the descendants of that vertex). Time for the source starts
at 1 and increments by 1 when you visit a vertex.
Note: You may assume that the vertices in each adjacency list is in alphabetical order.

Problem 1. (a) Run BFS algorithm on the directed graph below, using vertex A as the source.
Show all distances and the BFS tree.
(b) Run DFS algorithm on the directed graph below, using vertex A as the source. Compute
the start time and the finish time of each vertex and draw the DFS tree. Start time of a
vertex would be when you first visit it and the finish time, when you visit that last (i.e.,
you have already explored all the descendants of that vertex). Time for the source starts
at 1 and increments by 1 when you visit a vertex.
Note: You may assume that the vertices in each adjacency list is in alphabetical order.

Added by Marcus A.

Question

Please give Ace some feedback