Author(s)

Wei Wang, Hai Zhao, Hui Li, Jun Zhang, Peng Li, Zheng Liu, Naiming Guo, Jian Zhu, Bo Li, Shuang Yu, Hong Liu, Kunzhan Yang

.

Betweenness centrality helps researcher to master the changes of the system from the overall perspective in software network. The existing betweenness centrality algorithm has high time complexity but low accuracy. Therefore, Layer First Searching (LFS) algorithm is proposed that is low in time complexity and high in accuracy. LFS algorithm searches the nodes with the shortest to the designated node, then travels all paths and calculates the nodes on the paths, at last get the times of each node being traveled which is betweenness centrality. The time complexity of LFS algorithm is O(V2).

LFS, Software Network, the Shortest Path, Betweenness Centrality

W. Wang, H. Zhao, H. Li, J. Zhang, P. Li, Z. Liu, N. Guo, J. Zhu, B. Li, S. Yu, H. Liu and K. Yang, "Research on LFS Algorithm in Software Network," Journal of Software Engineering and Applications, Vol. 3 No. 2, 2010, pp. 185-189. doi: 10.4236/jsea.2010.32023.