About this document

Understanding Cyclomatic Complexity by qabiswajit is a document available to read on EtoBox.

Cyclomatic complexity is a software metric that measures the complexity of a program based on the number of linearly independent paths through its source code. It is calculated using a control flow graph representation of the program that depicts nodes for processing tasks and edges for control flow between nodes. The complexity, V(G), is equal to the number of edges minus the number of nodes plus 2. A higher complexity number indicates a more complex program that will be more difficult and time-consuming t

Author

qabiswajit

Language

EN