Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Цикломатическая сложность× | Сложность Хэлстеда× | |
|---|---|---|
| Область | Численные методы | Численные методы |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1976 | 1977 |
| Автор метода≠ | Thomas McCabe | Maurice Halstead |
| Тип≠ | Control-flow complexity metric | Static code analysis metric |
| Основополагающий источник≠ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, SE-2(4), 308–320. DOI ↗ | Halstead, M. H. (1977). Elements of Software Science. Elsevier. ISBN: 0444002057 |
| Другие названия | CC, cyclomatic number, McCabe complexity | Halstead metrics, program length, volume metric |
| Связанные | 1 | 1 |
| Сводка≠ | 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. | 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. |
| ScholarGateНабор данных ↗ |
|
|