Programming, Computer Science, Graph Theory, Graph, Mathematics.
current node being searched into a queue. As an example assume the queue will look like [5, 6, 3, 4]. Because of the first in first out nature, the first ones added to the queue are the first ones out of the queue, so it would search in the order 4, 3, 6, 5. Breadth first search searches in