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

**Cyclomatic** is ...

===== Definition #1 Graph Theory =====
It is used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one.

===== Definition #2 Network Analysis =====
It is used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs.

===== Definition #3 Programming =====
It is of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code.

Source: [[https://en.wiktionary.org/wiki/cyclomatic ]]


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