Abstract: 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.

Key words: open source software, random graph, structure entropy, coupling, cohesion

摘要： 针对大型开源软件的复杂性，提出一种基于随机图和结构熵的开源软件结构复杂度的度量方法。将开源软件中的软件包抽象成点，将软件包之间的依赖关系抽象成有向边，建立随机图，并引入结构熵的概念。结合随机图的特性和结构熵度量开源软件的耦合度和内聚度。利用该方法进行实例分析，结果表明，随着开源软件按版本发展，软件耦合度和内聚度不断增长。

关键词: 开源软件, 随机图, 结构熵, 耦合, 内聚

CLC Number: 

• TP311.5