You are here: irt.org | FOLDOC | cyclomatic complexity
<programming, testing> A measure of the number of linearly independent paths through a program module. Cyclomatic complexity is a measure for the complexity of code related to the number of ways there are to traverse a piece of code. This determines the minimum number of inputs you need to test all ways to execute the program.
(1998-03-17)
Nearby terms: cyclic redundancy check « cyclic redundancy code « Cyclo « cyclomatic complexity » Cygnus Tcl Tools » cylinder » CypherText
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL