Repository files navigation

Cyclomatic complexity is a source code complexity measurement that is being correlated to a number of coding errors. It is calculated by developing a Control Flow Graph of the code that measures the number of linearly-independent paths through a program module.

Lower the Program's cyclomatic complexity, lower the risk to modify and easier to understand.Cyclomatic complexity = E - N + 2*Pwhere,

• E = number of edges in the flow graph.
• N = number of nodes in the flow graph.
• P = number of nodes that have exit points

If the decision points are more, then complexity of the program is more. If program has high complexity number, then probability of error is high with increased time for maintenance and trouble shoot.

This repository contains working project code used in video Course by Packt Publication with title "Learn Design Patterns with Java " authored by "Aseem Jain".

https://www.packtpub.com/application-development/learn-design-patterns-java-9-video

https://premaseem.wordpress.com/category/computers/design-patterns/

https://www.facebook.com/DesignPatternGuru/