方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| CK度量× | 圈复杂度 (Cyclomatic Complexity, CC)× | |
|---|---|---|
| 领域 | 数值方法 | 数值方法 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 | 1976 |
| 提出者≠ | Shyam Chidamber and Chris Kemerer | Thomas McCabe |
| 类型≠ | Design quality metric suite | Control-flow complexity metric |
| 开创性文献≠ | Chidamber, S. R., & Kemerer, C. F. (1994). A metrics suite for object-oriented design. IEEE Transactions on Software Engineering, 20(6), 476–493. DOI ↗ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, SE-2(4), 308–320. DOI ↗ |
| 别名 | OO metrics, CK suite, object-oriented complexity | CC, cyclomatic number, McCabe complexity |
| 相关 | 1 | 1 |
| 摘要≠ | CK Metrics is a suite of six object-oriented design metrics introduced by Chidamber and Kemerer in 1994 to measure class complexity, cohesion, and coupling. The metrics quantify OO design quality; high coupling and low cohesion predict defects and maintenance effort. | 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数据集 ↗ |
|
|