This Demonstration illustrates the enumeration order of a breadth-first search, an algorithm that explores all nodes one level at a time. Left-to-right ordering is used but this is not mandatory in a breadth-first search. The degree of the tree is the maximum number of edges per vertex.