The edge update of minimum spanningforest is very important in network routing and many other areas.
最小生成森林的边更新在网络路由等方面有着重要的应用价值。
2
We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanningforest, and a random connected subgraph respectively.
本文研究图g的子图空间g上的三类概率测度，它们分别刻画图的随机扩张树，随机扩张森林和随机连通子图。
3
With trees equal to one hectare of forestspanning 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.