what is cyclomatic complexity? plz explain with example

Answer Posted / 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



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Are there more defects in the design phase or in the coding phase?

941


WHAT IS PROTOCAL TESTING..EXPLAIN? L2, L3 PROTOCALS TESTING MEANS WHAT?EXPLAIN BRIEFLY

6305


What ishigh severity, low priority bug?

701


ANY ONE HAS ATTENDED THE INTERVIEW FOR WIT INNOVATION P LTD? THEN KINDLY LET ME KNOW ABOUT THE INTERVIEW PROCESS AND QUESTIONS ASKED.

1750


I have 6 months experience as project tarine and one and a half year experience as software engineer.Should i write taht my total experience id 2 years.

1506






Why Equivalence Partitioning is called equivalence or what is the significance of equivalence term in ECP?

1645


what is acid testing?

2141


What are the possible test scenarios around AVS check of any credit card? (Testing through payment gateway online) (What are the fields we should check while checking AVS and CVV)

1130


What are the factors affecting a manual testing project and what are the ways to overcome it?

733


What is common interface?

1532


what is the function generator?

1710


What are the main key components in Web applications and Client Server applications? and their differences?

1511


Can some one help me writing a manual test case for email applications like yahoo i need for www.everonn.com

1539


what types of bugs will we find out in banking projects

1847


can anybody tell me what is release process of company? release note?

1505