Pronunciations
-
/ˌsaɪkləˈmætɪk/
Adjective
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.
Usage- not-comparable
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.
Usage- not-comparable
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.
Usage- not-comparable
- Examples
-
This finding reveals that the drawing of a CFG for a given program or component is not necessary in the cyclomatic analysis.