ScholarGate
助手
Process / pipelineCode quality assessment

软件复杂度度量

软件复杂度度量通过数值测量量化代码的结构和操作难度。托马斯·麦凯布(Thomas McCabe)于1976年引入的圈复杂度(cyclomatic complexity)成为其基础方法。这些度量评估可维护性、可测试性和缺陷风险,使团队能够识别有问题的代码区域并指导重构工作。

在 MethodMind 中打开即将推出视频即将推出Download slides

阅读完整方法

仅限会员

使用免费账户登录即可阅读本节。

登录

Method map

The neighbourhood of related methods — select a node to explore.

来源

  1. McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI: 10.1109/TSE.1976.233837
  2. Chidamber, S. R., & Kemerer, C. F. (1994). A metrics suite for object-oriented design. IEEE Transactions on Software Engineering, 20(6), 476–493. DOI: 10.1109/32.295895
  3. Halstead, M. H. (1977). Elements of Software Science. Elsevier. link

如何引用本页

ScholarGate. (2026, June 3). Software Complexity Metrics and Measurement. ScholarGate. https://scholargate.app/zh/software-engineering/software-complexity-metrics

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

被引用于

ScholarGateSoftware Complexity Metrics (Software Complexity Metrics and Measurement). 于 2026-06-15 检索自 https://scholargate.app/zh/software-engineering/software-complexity-metrics · 数据集: https://doi.org/10.5281/zenodo.20539026