Cyclomatic Complexity - what does this really mean…. here is a definition from wiki:
"Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program." - grrrrrrrrr I guess that was irritating to understand.. And guess what... Trying to understand might increase the cyclomatic complexity of your life at least by 1 J I hope now you understand what it really means!!!
"Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program." - grrrrrrrrr I guess that was irritating to understand.. And guess what... Trying to understand might increase the cyclomatic complexity of your life at least by 1 J I hope now you understand what it really means!!!
Just looking at life every day I wonder how to measure the complexity of life. Can’t help it, got used to measure everything, being a software engineer!!! The worst part is, in life the root node for the graph is always you and everything revolves around you, pathetic human life. Like the code, in life too, every – if, for, while- adds up to the complexity
How to reduce the complexity? No conditions – No Control Structures but is that really possible? I am trying to make it easy as possible but still feel the complexity, at least at times.
No comments:
Post a Comment