Rare card
Breadth-first search
- Value
- 50 W
- Attack
- 291
- Defence
- 232
- Players
- 0
In computer science, breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level.
Get Breadth-first search in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack