So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Cyclomatic Complexity× | Độ phức tạp Halstead× | |
|---|---|---|
| Lĩnh vực | Phương pháp số | Phương pháp số |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 1976 | 1977 |
| Người khởi xướng≠ | Thomas McCabe | Maurice Halstead |
| Loại≠ | Control-flow complexity metric | Static code analysis metric |
| Công trình gốc≠ | 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 |
| Tên gọi khác | CC, cyclomatic number, McCabe complexity | Halstead metrics, program length, volume metric |
| Liên quan | 1 | 1 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|