Bellman最优原理在复杂加权网络中的应用研究

针对现有算法及软件计算复杂加权网络介数的局限性,应用Bellman最优原理于复杂加权网络介数计算中,并针对复杂网络动态演化,节点众多,重点,节点间无边连接等特点作了相应修改.依算法实例计算出了复杂加权网络的最短路径长、最短路径和介数,最后经验证算法具有较快的运行速度和较准确的结果.

The Application of Bellman Optimum Principle to Complex Weighted Networks

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.