====== Cyclomatic Complexity ======
[[dido:public:ra:xapend:xapend.a_glossary:start| Return to Glossary ]]

**Cyclomatic Complexity**, in Software Testing, is a testing metric used for measuring the complexity of a software program. It is a quantitative measure of independent paths in the source code of a software program. [[dido:public:ra:xapend:xapend.a_glossary:c:cyclomatic#definition_3_programming | Cyclomatic]] Complexity can be calculated by using control flow graphs or with respect to functions, modules, methods or classes within a software program.

Source: [[https://www.guru99.com/cyclomatic-complexity.html ]]


/**=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
/* To add a discussion page to this page, comment out the line that says 
  ~~DISCUSSION:off~~
*/
~~DISCUSSION:on|Outstanding Issues~~
~~DISCUSSION:off~~