Cyclomatic complexity
• M = E − N + 2P
• E = the number of edges of the graph.
• N = the number of nodes of the graph.
• P = the number of connected components.
• https://en.wikipedia.org/wiki/Cyclomatic_complexity
Slide 5
Slide 5 text
Limiting complicated code
• National Institute of Standards and Technology - 10
• Either
• Under the limit
• Provide a written explanation of why it become so
complicated