Q3 (10 points) Consider the following graph. H 1 A G D с Do a DFS traversal, starting at vertex B. Whenever DFS selects

[answerhappygod]

1 (85.55 KiB) Viewed 61 times

Q3 (10 points) Consider the following graph. H 1 A G D с Do a DFS traversal, starting at vertex B. Whenever DFS selects an edge from several unvisited edges, selected the one the comes first in lexicographical order. Example: If the DFS would pick one of the following edges: (A, F), (A, E), (A, C), the one to be chosen is (A, C) since C is listed in the alphabet before E and F. List all the vertices in the order discovered by the DFS.