Implementation of Cylomatrix Complexity Matrix
Cyclomatic complexity (or conditional complexity) is a software metric (measurement). It directly measures the number of linearly independent paths through a program's source code. The concept, although not the method, is somewhat similar to that of general text complexity measured by the Flesch-Kincaid Readability Test. Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program.
Cyclomatic Complexity; Readability; Test
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.
JNIC©: World Science Publisher United States