# What is Cyclomatic complexity

#### Subbu4testing Profile Answers by Subbu4testing

• Nov 1st, 2006

Cyclometric complexityt is number of indipendent paths through the program.It gives complexity of the code.

Cyclometri complxity=number of decisions+1

#### jainbrijesh Profile Answers by jainbrijesh Questions by jainbrijesh

• Nov 2nd, 2006

It's calculated for doing white box testing. It's done by making a control flow diagram.It is a measure of the complexity of a software module,and equal to (e - n + 2). where e is the number of edges in the control flow graph :and n is the number of nodes in this graph ;It tells about no. of independend paths in a program code.

#### Lalitha Karthik

• Nov 9th, 2006

Cyclomatic complexity gives the number of independant paths in a Program,its denoted by a Number

#### laxman

• Nov 21st, 2006

During BASIS PATH TESTING,programmers run the programme more than one time on all possible individual paths to detect run time errors. These no.of individual paths is called as 'CYCLOMATIC COMPLEXITY'

#### bharathi

• Dec 13th, 2006

To find the independent paths in a program file

#### santosh sunkoji

• Dec 14th, 2006

Cyclomatic Complexity is a software metric that provides a quantitative measure of the logical complexity of a program

• Dec 21st, 2006

Hi,

A measure of the logical complexity of an algorithm, used in white-box testing.

Cyclomatic complexity, V (G), for a flow graph G is equal to

1. The number of regions in the flow graph.
2. V (G) = E - N + 2 where E is the number of edges and N is the number of nodes.
3. V (G) = P + 1 where P is the number of predicate nodes.

Regards

#### Sujatars Profile Answers by Sujatars

• Jan 9th, 2007

Cyclomatic Complexity is number of decision statement plus one.

Given any computer program, draw its control flow graph, G, where each node corresponds to a

block of sequential code and each edge corresponds to a branch or decision point in the program.

The cyclomatic complexity of such a graph can be computed by a simple formula from graph

theory, as v(G)=e-n+2, where e is the number of edges, and n is the number of nodes in the graph