We go back to the while loop, the queue is not empty, we take off the first vertex, in this case that's gonna be B. B has three incident edges, it has one incident S but that's irrelevant, we've already seen S. It has one incident to C, that's also irrelevant, that's also irrelevant, because we've already seen C. 