cyclomatic

• IPA^(key): /ˌsaɪkləˈmætɪk/

cyclomatic (not comparable)

1. (graph theory) Used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one.
2. (network analysis) Used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs.
3. (software engineering) Of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code.
   • 2007, Yingxu Wang, Software Engineering Foundations: A Software Science Perspective, CRC Press, →ISBN, page 820:

     This finding reveals that the drawing of a CFG for a given program or component is not necessary in the cyclomatic analysis.

• cocyclomatic
• cyclomatic complexity
• cyclomatic number

• circuit rank