Breadth-First Search Enumeration
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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.
Contributed by: Hector Zenil (August 2011)
Open content licensed under CC BY-NC-SA
"Breadth-First Search Enumeration"
Wolfram Demonstrations Project
Published: August 3 2011