论文标题
跨环境复杂性：图形上程序复杂性的双维度量
The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs
论文作者
论文摘要
减少和控制复杂性是软件设计中的重要实践。循环复杂性（CC）是最受欢迎的软件指标之一，已有40多年的历史。尽管CC是一个有趣的指标，可以突出程序中的分支数量，但显然不足以表示软件中的复杂性。在本文中，我们介绍了跨环境复杂性（CCC），这是图表上的一种新的双维复杂度度量，它结合了曲《笛卡尔计划》中AS对AS的最小重量循环基础的重量，以使用控制流程图来表征程序复杂性。我们的假设为代表计划复杂性的新场地开放，我们讨论了它的含义和机遇。
Reduce and control complexity is an essential practice in software design. Cyclomatic complexity (CC) is one of the most popular software metrics, applied for more than 40 years. Despite CC is an interesting metric to highlight the number of branches in a program, it clearly not sufficient to represent the complexity in a piece of software. In this paper, we introduce the cross cyclomatic complexity (CCC), a new bi-dimensional complexity measure on graphs that combines the cyclomatic complexity and the weight of a minimum-weight cycle basis in as pair on the Cartesian plan to characterize program complexity using control flow graphs. Our postulates open a new venue to represent program complexity, and we discuss its implications and opportunities.
