cyclomatic (not comparable)
- (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.
- (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.
- (programming) 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.
In network analysis