How the value of P in cyclomatic complexity is calculated?
P:The number of connected path.
- 1 Answers
- 6330 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 Friends, I have recently completed Testing course and planning to apply for jobs, I am Planning to put Banking Project in my resume but b4 that I need your help guys According to my knowledge in the banking project basically it contains 3 modules say 1. Banker 2. Admin 3. Customer Could you please explain me in terms of interview like how to explain each module and what exactly each module does and what type of testings we can do on banking project. Any help would be appreciated Thanks in advance Swapna
What r the properties of Radio Button and Table Grid?How do we test Table Grid?
How many TC you have written?How many TC you can write in a day?How many TC can you execute in a day?
What do you do if the bug that you found is not accepted by the developer and he is saying its not reproducible.
who preapares use case document? who preapares use functional point document? who preapares use test sceanario document?
Could anyone let me know five positive and negative testcases for ATM machine..?
diff between usecase and testcase
how can u do database testing manually?
What is AGP?what is setup.inf?What are the ways to install driver?
Explain number of production defects measure?
Easiest way to write test cases? How i can learn writing the test cases?
what is database testing?
Automation Testing 
