Measure Method of Structural Complexity in Open Source Software
Gao Jian-hua · Jisuanji gongcheng · 2010
In order to study the complexity of the large-scale open source software,this paper models the packages in the open source software as vertices and the dependency relationships among these packages as directed edges.It uses random graph measure and structure entropy to propose a new method of measuring structural complexity of open source software.It uses the method by the fact to investigate that as the release of the open source software evolves,the coupling and cohesion grow from lower to higher.