Question: If the below graph is searched by both depth-first search and breadth-first search starting from D , and if neighbors are searched in alphabetical
If the below graph is searched by both depth-first search and breadth-first search starting from ‘D’, and if neighbors are searched in alphabetical order, what will be the order in which the nodes are visited?
a.) Using depth-first search
b.) Using breadth-first search
D E B J F K H
Step by Step Solution
3.48 Rating (148 Votes )
There are 3 Steps involved in it
a ... View full answer
Get step-by-step solutions from verified subject matter experts
