Skip to content

Concept of complexity explained #6

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
premaseem wants to merge 8 commits into
base: develop
Choose a base branch
from
Open

Concept of complexity explained #6

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
0cb0577
updated gitignore
Dec 24, 2017
cd5f594
entered empty module.info
Dec 24, 2017
a0fbd97
cleaned up master
premaseem Dec 25, 2017
9472a4b
added modules files
premaseem Jan 3, 2018
1abc515
Concept of complexity explained
premaseem Jan 5, 2018
0a20831
Concept of complexity explained
premaseem Jan 5, 2018
5741080
Concept of complexity explained
premaseem Jan 7, 2018
c30a5c9
Update README.md
premaseem Aug 9, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Concept of complexity explained 
Update on Readme file
  • Loading branch information
@premaseem
premaseem committed Jan 7, 2018
commit 5741080bfc031088f852579770b4f04394ee3f26
12 changes: 12 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,2 +1,14 @@
## Video 2.1 of Design Patterns Tutorial uses this code

# Cyclomatic complexity
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*P
where,
E = number of edges in the flow graph.
N = number of nodes in the flow graph.
P = number of nodes that have exit points


# DesignPatternsJava9
This repo consists Gang of Four Design patterns code on Java 9. Each branch in the repository has code of 1 design pattern. Switch repository to try out different design patterns.