摘要
针对现有算法及软件计算复杂加权网络介数的局限性,应用Bellman最优原理于复杂加权网络介数计算中,并针对复杂网络动态演化,节点众多,重点,节点间无边连接等特点作了相应修改.依算法实例计算出了复杂加权网络的最短路径长、最短路径和介数,最后经验证算法具有较快的运行速度和较准确的结果.
Regarding of the limitations of computing complex weighted networks by existing algorithm and softwares, Bellman optimum principle was applied in it in this paper. Some extending was done to the original algorithm on the basis of such differeces between complex networks and small networks as dynamic evolving,numerous nodes, coincided nodes, no edges between nodes. In the end, through a real example the shortest route, its length and betweenness were worked out according to the algorithm. Moreover, the results showed a high accuracy and quicker operating speed.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第23期60-65,共6页
Mathematics in Practice and Theory
基金
国家自然科学基金(70361002)
南昌工程学院青年基金科技项目(2006KJ031)
关键词
复杂网络
权重
最短路径
介数
complex networks
weight
shortest route
betweenness
