research on lfs algorithm in software networklfs算法研究在软件网络.pdf

J. Software Engineering Applications, 2010, 3: 185-189 185 doi:10.4236/jsea.2010.32023 Published Online February 2010 (http://www.SciRP.org/journal/jsea) Research on LFS Algorithm in Software Network Wei Wang, Hai Zhao, Hui Li, Jun Zhang, Peng Li, Zheng Liu, Naiming Guo, Jian Zhu, Bo Li, Shuang Yu, Hong Liu, Kunzhan Yang Information Science and Engineering Northeastern University, Shenyang, China. Email: wangweiwin1@163.com, zhhai@ Received October 11th th th , 2009; revised October 26 , 2009; accepted November 5 , 2009. ABSTRACT 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). Keywords : LFS, Software Network, the Shortest Path, Betweenness Centrality 1. Introduction As mentioned in [6], the average path length is similar to normal distribution with the mean of 15.21. LFS algo- It is over fifteen years since Norman Fenton outlined the rithm is proposed based on this method. need for a scientific basis of software measurement. Such The dissertation contains three parts: First, take a theory is a prerequisite for a