Trace the execution of a Breadth-First Search given the graphabove as input.
Draw the state of the graph above at the start and end of eachBreadth-First Search call on a given vertex.
——————————————————————————————-
Maintain the call stack alongside your diagrams.
*At the start of the call is before anything is executed(beforethe vertex is marked).
*At the end is just after all lines of the function haveexecuted and the call would terminate.
Solution
BFS: Breadth First Search: It searcheslevel by level till all the vertices are visited and uses Queuedata structure.
bistenceo ビ BES 13 CH