breadth-first traversal
[BRED(th)-FIRST TRAV-er-sal]
nounpl: breadth-first traversals
travessia em largura / busca em largura
1. A graph and tree traversal algorithm that explores vertices/nodes level by level, visiting all neighbors at the current depth before moving to nodes at the next depth level
Breadth-first traversal uses a queue data structure to visit nodes in order of their distance from the starting node.
A travessia em largura utiliza uma fila para visitar os nós em ordem de sua distância do nó inicial.
2. An algorithm commonly used for finding shortest paths in unweighted graphs and for exploring connected components
In a breadth-first traversal of a social network, you would examine all direct friends before examining friends of friends.
Em uma travessia em largura de uma rede social, você examinaria todos os amigos diretos antes de examinar os amigos dos amigos.
This is specialized technical terminology primarily used in computer science, software engineering, and algorithm courses. It is uniformly understood across English and Portuguese-speaking tech communities. The term is language-agnostic in international tech documentation, often appearing as 'BFS' regardless of the surrounding language.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →