minimum spanning tree
[ˈmɪnɪməm ˈspænɪŋ triː]
nounpl: minimum spanning trees
árvore geradora mínima
1. A subgraph of a weighted graph that includes all vertices, is connected, is acyclic, and has the minimum possible total edge weight
The algorithm finds the minimum spanning tree by connecting all cities with the shortest total distance of roads.
O algoritmo encontra a árvore geradora mínima conectando todas as cidades com a menor distância total de estradas.
2. In graph theory, a spanning tree with the lowest sum of edge weights among all possible spanning trees
Kruskal's algorithm is commonly used to compute a minimum spanning tree in a weighted undirected graph.
O algoritmo de Kruskal é comumente usado para calcular uma árvore geradora mínima em um grafo não direcionado ponderado.
The term 'minimum spanning tree' is primarily used in computer science, discrete mathematics, and operations research contexts. In Brazil, it is a standard concept taught in computer science and engineering courses. The acronym MST is universally recognized in technical communities across both Brazil and the USA. This is specialized technical terminology with no significant cultural variations in usage between regions.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →