Cyclomatic complexity: Difference between revisions

Revision as of 07:09, 2 February 2006

Revision as of 07:15, 2 February 2006

Line 24:

<nowiki>Insert non-formatted text here</nowiki>

===Alternative Way === [KK] 02/02/06

Theres another simple way to get this "Cyclomatic Number", just calculate the "No. of Closed Loops" in the flow graph & increment it by 1.

Theres another simple way to get this "Cyclomatic Number", just calculatecount the "No. of Closed Loops" in the flow graph & increment it by 1.

i.e.

M = "No. of closed loops" + 1

where

M = Cyclomatic Number

There should be atleast "M" number of testcases for testing the particular flowgraph.

This is the bare-minimum necessity to test the flowgraph.

==Key Concept ==