... least significant end || 最低端，最末端 least spanning tree || 最小生成树 least square || 最小二乘方 ...
双语例句
1
It's a spanningtree if there's also at least one path between any two points, i.e., no network nodes are left unconnected.
如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。
2
The minimum labeling spanningtree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanningtree with the least number of labels.