what is cyclomatic complexity ?
- 2 Answers
- 9333 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nitin verma
Hi,
In the cyclometric complexity we find the best shortest
path to reach to the destination node.the formula for this
is
V(g)=e-n+2p
g= graph
e= edges
n= nodes
plz correct me if i m wrong...
nitin9360@gmail
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / kamal prakash
The number of independent paths through a program.
Cyclomatic
complexity is defined as: L ? N + 2P, where
-L = the number of edges/links in a graph
-N = the number of nodes in a graph
- P = the number of disconnected parts of the graph (e.g. a
called graph and a subroutine)
kamalzoom@gmail.com
| Is This Answer Correct ? | 2 Yes | 1 No |
Need Browser compatibility checklist? If any of you are having any doc or checklist on the same please share it with me.
What are the goals of a performance testing of a web application
What are all the important Key Metrics in Software Testing?
what r the topics coverd in maual testing? OR syllabus for manual testing
What is mean by incident logging system ?
What did you achieve being a tester
what are the possible test cases for online jobs search portal..if its a job seeker module and any 1 if u had worked on this proj pls share the bugs with sev and priority pls frends i need replies for these queries ..thanks in advance
Is compatabilitytestig and port testing are same
what and all i should be prepared for attending the software testing interview,because iam confused with how to get prepared,please some one tell me the main topics to get prepared for it.
How many test scripts can you prepare per a day?
wht is IEEE 829
what is ISTQB and CSTE which one is the right choice ? plz let me know and it would be a great advantage for many tester
Automation Testing 
