如果在第一个源节点出列后队列已经为空，广度优先搜索如何工作？

According to Wikipedia, when using Breadth-First Search, you have to dequeue the node so that you can visit all the children (or neighbors of that particular node). This makes complete sense to me: According to Wikipedia, when using Breadth-Firs