##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Summary
BFS explores graphs in waves, guaranteeing shortest paths by edge count. Think of the queue as a wave moving level by level.
You'll reach for BFS whenever you see "shortest path," "minimum steps," or "nearest" in unweighted graphs. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
