This algorithm starts from the root node and then, after exploring all the neighboring nodes first, it moves toward the next level of neighbors, which returns the shortest path to our solution. It uses the FIFO queue data structure.
The disadvantage of this algorithm is that it consumes a lot of memory because each level of nodes is saved in order to create the next one.
Read more at: https://en.wikipedia.org/wiki/Breadth-first_search.
Get Learning Android Game Development now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now