CYCLOMATIC COMPLEXITY
\sˌa͡ɪkləmˈatɪk kəmplˈɛksɪti], \sˌaɪkləmˈatɪk kəmplˈɛksɪti], \s_ˌaɪ_k_l_ə_m_ˈa_t_ɪ_k k_ə_m_p_l_ˈɛ_k_s_ɪ_t_i]\
Sort: Oldest first
-
A measure of the number of linearlyindependent paths through a program module. Cyclomaticcomplexity is a measure for the complexity of code related tothe number of ways there are to traverse a piece of code.This determines the minimum number of inputs you need to testall ways to execute the program.
By Denis Howe
