| 释义 |
minimal spanning tree algorithm
- 全长quán zhǎng
span
- 世交shì jiāo
friendship spanning for generations
- 最小限度的zuì xiǎo xiàn dù de
minimal
- 径距jìng jù
span
- 指距zhǐ jù
span
- 算法库suàn fǎ kù
algorithms library
- 运算法则yùn suàn fǎ zé
algorithm
- 最小的zuì xiǎo de
least, lowest, minimal, minimum
- 蟠木pán mù
twisted tree
- 庹tuǒ
arm spread; span
- 迭代算法dié dài suàn fǎ
iterative algorithm
- 槐树huái shù
Chinese scholar tree; pagoda tree; locust tree
- 目录树mù lù shù
directory tree
- 南欧紫荆nán ōu zǐ jīng
Judas tree
- 系谱图xì pǔ tú
family tree
- 拱跨gǒng kuà
span of arch
- 广度guǎng dù
extent, scope, span
- 横亘héng gèn
lie across, span
- 跨度kuà dù
span; fly-past; spacing
- 跨距kuà jù
span; spacing; step
- 拃zhà
measure by handspans; span
- 凤凰木fèng huáng mù
flame tree, flame-tree
- 麝香树shè xiāng shù
muskwood; musk tree
- 橦tóng
silk cotton tree; kapok tree
- 鞋楦xié xuàn
shoe tree; boot tree
|