Scribd Logo
Upload

Welcome to Scribd!

  • Cyclomatic Complexity Formula

    Uploaded by

    Aman Yadav
    8 views1 page
    Cyclomatic complexity is a measure of the number of linearly independent paths through a program's source code and is calculated as CC = E-N+2, where E is the number of edges and N is the number of nodes in the flow graph of the program. Alternatively, it can be calculated as CC = E - N + 2*P, where P is the number of nodes that have exit points.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Cyclomatic complexity is a measure of the number of linearly independent paths through a program's source code and is calculated as CC = E-N+2, where E is the number of edges and N is the number of nodes in the flow graph of the program. Alternatively, it can be calculated as CC = E - N + 2*P, where P is the number of nodes that have exit points.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    8 views1 page

    Cyclomatic Complexity Formula

    Uploaded by

    Aman Yadav
    Cyclomatic complexity is a measure of the number of linearly independent paths through a program's source code and is calculated as CC = E-N+2, where E is the number of edges and N is the number of nodes in the flow graph of the program. Alternatively, it can be calculated as CC = E - N + 2*P, where P is the number of nodes that have exit points.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Cyclomatic Complexity formula

    The formula for calculating CC is as:

    CC = E~N+2

    Where:
    E= Number of edges

    N= Number of nodes.

    Cyclomatic complexity = E - N + 2*P

    where,

    E = number of edges in the flow graph.

    N = number of nodes in the flow graph.

    P = number of nodes that have exit points

    You might also like