Starting from the node at the top, marked with the letter A,…
Starting from the node at the top, marked with the letter A, which algorithm (BFS or DFS) will visit the least number of nodes before visiting the node marked with the letter D? If there is ever a decision between multiple neighbor nodes in the BFS or DFS algorithms, assume we always choose the letter closest to the beginning of the alphabet first.
Read Details