网络连通度算法的性能分析与比较

Performance analysis and comparison of algorithms for measures of network connectivity

从四个方面分析和比较了两种求解网络连通度问题的算法性能.结果表明,在相同的计算环境下,两种算法的计算结果相同,但与基于最大流方法的算法相比,基于影响度向量的算法由于每次迭代只需要计算和存储点影响度向量和网络影响度向量,具有更高的计算效率,需要更小的存储空间,并且易于计算机实现.

Two algorithm＇ s performances on the network connection problem pared in this paper from four aspects. It shows that the two analyzed algorithms are analyzed and com- present the same result in the same computing environment. However, compared with the algorithm based on the maximum flow method, the alg6rithm which is based on influence vector is of better computation efficiency and smaller storage room with the reason that it only needs to compute and store the influence vector of point and network in single iteration. Besides, it is easy to proffram and calculate.