Answer:
Cyclomatic complexity is a complexity measure of code related to the number of ways there exists to traverse a piece of code. This measure determines the minimum number of test cases needed to test all the paths using linearly independent circuits.
| Previous Question | Next Question |
| What is statement coverage? | How is cyclomatic complexity computed? |