对连通图的键覆盖进行了研究。
In this paper, the bond cover of a connected graph was studied.
算法通功量化盘算网络外每个节里删除后闭于网络连通状况的影响，来做为节里的从要度，自而觅出网络外的闭键节里。
Quantification of the calculation the impact of network connectivity status after a network node removed, as an important node, in order to identify the key network nodes.
应用推荐