An Improved Dijkstra Algorithm Based on Community Structure in Complex Networks
Xing Huan-ge · Fuza xitong yu fuzaxing kexue · 2012
Based on local superiority of community structure in complex networks,each community 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 algorithm is used to military material transportation network system.