what is cyclomatic complexity? plz explain with example

Categories >> Software >> Testing >> Manual Testing
Suggest New Category

Question Posted / karthik

17 Answers
75920 Views
Accenture, I also Faced
E-Mail Answers

Answers were Sorted based on User's Feedback

what is cyclomatic complexity? plz explain with example..

Answer / deep singh kushwaha

Cyclomatic complexity is a software metric (measurement) developed by Thomas McCabe and is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code.
One of the ways is counting the number of closed loops in the flow graph, and incrementing the number by one.
i.e.
M = Number of closed loops + 1
where
M = Cyclomatic number.
Implications for Software Testing
M is a lower bound for the number of possible paths through the control flow graph.
M is an upper bound for the number of test cases that are necessary to achieve a complete branch coverage.
For example, consider a program that consists of two sequential if-then-else statements.
if (c1) {
f1();
} else {
f2();
}
if (c2) {
f3();
} else {
f4();
}
To achieve a complete branch coverage, two test cases are sufficient here.
For a complete path coverage, four test cases are necessary.
The cyclomatic number M is three, falling in the range between these two values, as it does for any program.

please suggest me if i m wrong..
e-mail-deepsingh.154@gmail.com

Is This Answer Correct ?

1 Yes

0 No

what is cyclomatic complexity? plz explain with example..

Answer / err. nilesh

cylomatic complexity is technique used to find out the path
coverage.Mathematically, the cyclomatic complexity of a
structured program[note 1] is defined with reference to the
control flow graph of the program, a directed graph
containing the basic blocks of the program, with an edge
between two basic blocks if control may pass from the first
to the second. The complexity M is then defined as:[2]

M = E − N + 2P

where

E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components

Is This Answer Correct ?

0 Yes

0 No

what is cyclomatic complexity? plz explain with example..

Answer / rahul

it is used to find out no. of independent path in graph.

v(g)=e-n+2p

v(g)=cyclomatic complexity of graph g
e=no.of edges in th graph
n=no. of node in tha graph
p=no.of connected component in the graph

Is This Answer Correct ?

2 Yes

3 No

what is cyclomatic complexity? plz explain with example..

Answer / nitin verma

In the Cyclometris Complexity we find the shortest path
between the nodes.The formula is
V(G)=e-n+2p where,

G= Graph
e= no. of edges
n= nodes
p= no. of paths

plz Correct me if i m wrong....

nitin9360@yahoo.com

Is This Answer Correct ?

27 Yes

36 No

what is cyclomatic complexity? plz explain with example..

Answer / karthikraj

Its a Whitebox technices
In this we findout the total number of paths......

Is This Answer Correct ?

9 Yes

31 No

what is cyclomatic complexity? plz explain with example..

Answer / rf

Is This Answer Correct ?

9 Yes

32 No

what is cyclomatic complexity? plz explain with example..

Answer / praveen kumar

Number of Decision Statements - 1

Is This Answer Correct ?

5 Yes

50 No

Post New Answer