Answer:
Cyclomatic complexity is computed using the control flow graph of the program, the nodes of the graph correspond to indivisible groups of sentences of a program and a directed edge connects two nodes if the second sentence might be executed immediately after the first sentence.
| Previous Question | Next Question |
| What is a cyclomatic complexity? | What does cyclomatic complexity apply to? |