How VectorCAST Determines Code Complexity
How does VectorCAST determine code complexity?
VectorCAST uses the McCabe Cyclcomatic Complexity algorithm to calculate the number of Basis Paths (using V(g) for the representation) through a subprogram. This is a fairly straightforward algorithm that basically counts the branches in a subprogram.
For a full description of the algorithm and its relationship to testing, please see NIST Special Publication 500-235 (Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric)
Article ID: 1481
Last updated: 2019-10-29
VectorCAST -> Basics and (Un)Installation -> How VectorCAST Determines Code Complexity