قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| تعقيد هالستيد× | التعقيد السيكلوماتيكي (Cyclomatic Complexity)× | |
|---|---|---|
| المجال | الطرق العددية | الطرق العددية |
| العائلة | 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مجموعة البيانات ↗ |
|
|