cyclomatic complexity

短语

词形变化

cyclomatic complexities 复数

释义与例句

n.
  1. 1.

    A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function.

    可数 不可数 计算机 工程 数学