Question: 12. Consider the following directed graph. EX (a) List the nodes in the order they would be visited in a depth-first search of the graph

12. Consider the following directed graph. EX (a) List the nodes in the order they would be visited in a depth-first search of the graph starting at A. When choosing a node to explore next, break ties in favor of the alphabetically least. (b) List the nodes in the order they would be visited in a breadth-first search of the graph starting at A. When choosing a node to explore next, break ties in favor of the alphabetically least
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
