What is cyclomatic complexity explain with the help of an example

Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program.N is the total number of nodes in the flow graph.E is total number of edges in the flow graph.P = represents a number of nodes that have exit points in the control.The cyclomatic complexity algorithm is used to derive a measurable value based on the number of edges and nodes within the graph as well as the total count of connected components or exit nodes.The amount of complexity in a program is often determined by the amount of time and effort that went into it.

It is a practice that if the result of cyclomatic complexity is more or a bigger number, we consider that piece of functionality to be of complex nature and hence we conclude as a tester;Read along or jump to the section that interests you the most:The cyclomatic number is equal to the number of linearly independent paths through a program in its graphs representation.Every time there's an if statement or other control block like a loop, cyclomatic complexity goes up, since the graph will look more and more like a tree.So cyclomatic complexity can predict how hard it is to test a given piece of code.The cyclomatic complexity of a method is calculated with this formula:

This is a measure in software used to display how complex a system is and is measured with the system control flow graph.Myers' interval is an extension to cyc.It is a software metric that measures the logical complexity of the program code.For a program control graph g, cyclomatic number, v (g), is given as: