复杂系统与复杂性科学
複雜繫統與複雜性科學
복잡계통여복잡성과학
COMPLEX SYSTEMS AND COMPLEXITY SCIENCE
2012年
4期
34-39
,共6页
加权复杂网络%最短路%社区结构
加權複雜網絡%最短路%社區結構
가권복잡망락%최단로%사구결구
weighted complex networks%shortest path%community structure
针对复杂网络中社区结构局部优势,将每个社区塌陷为一个节点,利用局部优势向全局优势扩展的方法,将Dijkstra算法进行了改进,提出了一种基于社区结构的复杂网络最短路算法,分析了该算法的时间复杂度,并将该算法应用于战时军事物资前送体系网络.
針對複雜網絡中社區結構跼部優勢,將每箇社區塌陷為一箇節點,利用跼部優勢嚮全跼優勢擴展的方法,將Dijkstra算法進行瞭改進,提齣瞭一種基于社區結構的複雜網絡最短路算法,分析瞭該算法的時間複雜度,併將該算法應用于戰時軍事物資前送體繫網絡.
침대복잡망락중사구결구국부우세,장매개사구탑함위일개절점,이용국부우세향전국우세확전적방법,장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 .
