When traversing an undirected graph using breadth first search that has no parallel edges and self loops, there exists a vertex x with an adjacent vertex y. When processing