Breadth-First Search
A graph traversal algorithm that explores a graph one level at a time. It starts at one node, visits all of its direct neighbors, then visits the neighbors of those nodes, and continues outward.
A graph traversal algorithm that explores a graph one level at a time. It starts at one node, visits all of its direct neighbors, then visits the neighbors of those nodes, and continues outward.
Share this glossary:
Share on Facebook Share on Twitter Share via Email Share on LinkedIn Share on Pinterest