Breadth-First Search Enumeration

Initializing live version
Download to Desktop

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


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send