How the value of P in cyclomatic complexity is calculated?
P:The number of connected path.
- 1 Answers
- 5407 Views
- I also Faced
- E-Mail Answers
Answer / dheeraj shandilya
McCabe's cyclomatic complexity(M) is given by:
M=L-N+2P
where L= no. of links in flowgraph
N= no. of nodes in flowgraph and
P= no. of connected component
(or no. of disconnected parts of flowgraph)
In graph theory, a connected component of an undirected
graph is a subgraph in which any two vertices are connected
to each other by paths, and which is connected to no
additional vertices. For example, see slide no 21(40) of
www.cs.drexel.edu/~spiros/teaching/SE320/slides/metrics.ppt
| Is This Answer Correct ? | 6 Yes | 0 No |
Hi, Please tell how to write system test cases for between two modules. please ans real time expirience people... thanks in advance..
what is the difference between test case and testscenario,plz answer for this
How to derive test data from the design documents?
Explain number of production defects measure?
What type of Bugs will occur in Banking Project and pls send the Scenario,Testcases for the same?
what is the difference between 2-tier appli. and 3-tier appli. testing
What is meant by Entry and Exit points in Testing? Raam - ramumcato@yahoo.com
What is neutral test case?
wat is test deliverables
5 Answers Calpine Technologies, CTS,
How much interaction with users should testers have, and why?
u have 1000 of delete button in ur application ,how to check it out,.one by one ? or how to check it out by easy way?
what is ECP?
Automation Testing 
