请输入您要查询的字词:

 

单词 MinimumSpanningTree
释义

minimum spanning tree


Given a graph G with weighted edges, a minimum spanning treeMathworldPlanetmath is a spanning treeMathworldPlanetmath with minimum weight, where the weight of a spanning tree is the sum of the weights of its edges. There may be more than one minimum spanning tree for a graph, since it is the weight of the spanning tree that must be minimum.

For example, here is a graph G of weighted edges and a minimum spanning tree T for that graph. The edges of T are drawn as solid lines, while edges in G but not in T are drawn as dotted lines.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/5 5:56:53