Statics Measures Question:
What does cyclomatic complexity apply to?
Answer:
Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program, and is formally defined as follows:
v(G) = E − N + 2P
where E is the number of edges of the graph, N is the number of nodes of the graph and P is the number of connected components.
v(G) = E − N + 2P
where E is the number of edges of the graph, N is the number of nodes of the graph and P is the number of connected components.
| Previous Question | Next Question |
| How is cyclomatic complexity computed? | What are the kinds of measures? |