spanning tree
[/ˈspænɪŋ triː/]
nounpl: spanning trees
árvore geradora
1. In graph theory and computer science, a subgraph of a connected graph that includes all vertices and is itself a tree (a connected acyclic graph)
The algorithm finds a spanning tree by connecting all nodes without creating any cycles.
O algoritmo encontra uma árvore geradora conectando todos os nós sem criar ciclos.
2. A minimal connected subgraph that reaches every vertex in the original graph
Network designers use spanning trees to avoid broadcast storms in switched networks.
Projetistas de rede utilizam árvores geradoras para evitar tempestades de broadcast em redes comutadas.
This is a specialized term primarily used in academic and professional contexts within computer science, mathematics, and network engineering. It is consistently translated as 'árvore geradora' in Portuguese-speaking countries. The term is essential in algorithms, data structures, and network topology discussions, particularly in the context of the Spanning Tree Protocol (STP) used in network switches.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →