cyclocomp (Q1352516): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Swh import (talk | contribs)
SWHID from Software Heritage
 
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:00021c467c02e388afcc38a0173e1fc5449405ab / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:00021c467c02e388afcc38a0173e1fc5449405ab / qualifier
 
Property / Software Heritage ID: swh:1:snp:00021c467c02e388afcc38a0173e1fc5449405ab / qualifier
 
point in time: 15 September 2023
Timestamp+2023-09-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0

Latest revision as of 23:42, 13 March 2024

Cyclomatic Complexity of R Code
Language Label Description Also known as
English
cyclocomp
Cyclomatic Complexity of R Code

    Statements

    0 references
    1.1.0
    10 September 2016
    0 references
    1.0.0
    20 February 2016
    0 references
    1.1.1
    30 August 2023
    0 references
    0 references
    30 August 2023
    0 references
    Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers