The edge update of minimum spanning forest is very important in network routing and many other areas.
最小生成森林的边更新在网络路由等方面有着重要的应用价值。
We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.
本文研究图g的子图空间g上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。
With trees equal to one hectare of forest spanning 27 floors, these 365 and 260-foot emerald, twin towers will be home to an astonishing 730 trees, 5, 000 shrubs and 11, 000 ground plants.
27个楼层覆盖满了相当于一公顷森林面积的树木，这两座分别高365英尺（111米）和260英尺（79米）的高楼变成了翠绿色。 这座双塔式建筑将种满730棵树木、500棵灌木以及1.1万株地面植物。
With trees equal to one hectare of forest spanning 27 floors, these 365 and 260-foot emerald, twin towers will be home to an astonishing 730 trees, 5, 000 shrubs and 11, 000 ground plants.
27个楼层覆盖满了相当于一公顷森林面积的树木，这两座分别高365英尺（111米）和260英尺（79米）的高楼变成了翠绿色。 这座双塔式建筑将种满730棵树木、500棵灌木以及1.1万株地面植物。
应用推荐