Breadth-First Search

Term side of the Card
Topic: Search Algorithms
Unit title: Breadth-First Search
Categories: Algorithm
Explanation side of the Card

Explanation: The traversal algorithm that explores all neighbors of a node before moving to the next level. Useful in finding the shortest path and detecting connected components.

Edit on GitHubContributions in our content repository are 🤗 welcome from everyone.Link leads to the Contributions guidelines on GitHubLink leads to the content repository on GitHub