Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Aliquam cursus diam orci, eu aliquet orci maximus in. Quisque quis justo cursus, scelerisque dolor eget, vehicula nisi. Donec volutpat ligula ut mi dignissim fermentum. Nulla facilisi. Ut vel dignissim velit, eu euismod sem. Vestibulum augue nulla, ullamcorper et tellus et, hendrerit gravida eros. Curabitur sapien dui, convallis elementum iaculis sit amet, imperdiet vitae ligula. Curabitur molestie semper nulla, vel gravida purus pulvinar id.