- 跨越树(生成树)
- 扫瞄树
- 生成树, 支撑树
- 最大树生成树
下载手机词典可随时随地查词查翻译
spanning tree中文什么意思
例句与用法
- 更多例句： 上一页 下一页
- A protection algorithm for mesh virtual ring based on spanning tree
一种光网络中统一网管的实现方案 - Algorithm of documents categorization based on bayesian - spanning tree
基于贝叶斯扩张树的文本分类算法 - Algorithm and analysis of fuzzy minimal spanning tree in fluid pipeline networks
流体管网中模糊最小树的算法与分析 - Asymptotic enumeration theorem for the number of spanning trees in grids and tori
格子图与环纹面的支撑树数的渐近定理 - Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法
百科释义
In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G. Informally, a spanning tree of G is a selection of edges of G that form a tree spanning every vertex.
详细百科解释