方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Halstead Complexity× | 圈复杂度 (Cyclomatic Complexity, CC)× | |
|---|---|---|
| 领域 | 数值方法 | 数值方法 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1977 | 1976 |
| 提出者≠ | Maurice Halstead | Thomas McCabe |
| 类型≠ | Static code analysis metric | Control-flow complexity metric |
| 开创性文献≠ | Halstead, M. H. (1977). Elements of Software Science. Elsevier. ISBN: 0444002057 | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, SE-2(4), 308–320. DOI ↗ |
| 别名 | Halstead metrics, program length, volume metric | CC, cyclomatic number, McCabe complexity |
| 相关 | 1 | 1 |
| 摘要≠ | Halstead Complexity Metrics are a set of static code analysis measures developed by Maurice Halstead in 1977 that quantify software quality using operator and operand counts. Metrics like program volume, difficulty, and effort estimate code complexity, maintainability, and defect likelihood from source code structure alone. | Cyclomatic Complexity (CC), introduced by Thomas McCabe in 1976, is a quantitative metric measuring the number of linearly independent paths through a function's control-flow graph. A function with high cyclomatic complexity is harder to understand, test, and maintain; McCabe advocated a threshold of 10 as the complexity limit for maintainability. |
| ScholarGate数据集 ↗ |
|
|