مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| پیچیدگی چرخهای (Cyclomatic Complexity)× | Halstead Complexity× | |
|---|---|---|
| حوزه | روشهای عددی | روشهای عددی |
| خانواده | 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مجموعهداده ↗ |
|
|