The basic idea of Breadth First Search is to start at a chosen vertex, visits all of its not$-$yet$-$visited neighbors, then all of their not$-$yet$-$visited neighbors, etc. The algorithm gets its name from $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

The basic idea of Breadth First Search is to start at a chosen vertex, visits all of its not$-$yet$-$visited neighbors, then all of their not$-$yet$-$visited neighbors, etc. The algorithm gets its name from $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

the algorithm for making a sandwich by starting and ending with a slice of bread.

its attempt to go as wide as possible before proceeding to vertices that are another level away from the source.

the computer programmer being out of breath after completing all the steps of the algorithm.

the computer being out of breath after completing all the steps of the algorithm.