Cyclomatic Complexity

Cyclomatic Complexity, also known as McCabe Cyclomatic Complexity or Conditional Complexity, is the measure of the complexity of a function’s decision structure. Cyclomatic Complexity counts the number of independent paths through a module.
Understand lets you:

  • export metrics to spreadsheets
  • view them graphically
  • dynamically explore them in the GUI
  • extract them automatically via command line calls
  • customize metrics via the Understand Perl API

Other Complexity Metrics

Understand also calculates many other complexity metrics, including the Path Count, Depth of Inheritance Tree(DIT), Nesting, Knots, Halstead Complexity (via plugin) and several variants of Cyclomatic Complexity. Click here for a complete list of complexity metrics that Understand supports.