摘要
针对复杂网络中社区结构局部优势,将每个社区塌陷为一个节点,利用局部优势向全局优势扩展的方法,将Dijkstra算法进行了改进,提出了一种基于社区结构的复杂网络最短路算法,分析了该算法的时间复杂度,并将该算法应用于战时军事物资前送体系网络。
Based on local superiority of community structure in complex networks, each communi- ty is viewed as a node. Expanding local superiority to global superiority, the Dijkstra algorithm is improved. Analysising characters of community structure, an algorithm is proposed to calculate the shortest path based on complex networks. The complexity of algorithm is counted. The algo- rithm is used to military material transportation network system.
出处
《复杂系统与复杂性科学》
EI
CSCD
北大核心
2012年第4期34-39,共6页
Complex Systems and Complexity Science
基金
军队研究生资助课题(2010JY0684-394)
关键词
加权复杂网络
最短路
社区结构
weighted complex networks
shortest path
community structure
