Slide 22
Slide 22 text
Ⅴ.�Cyclomatic�
complexity�(1)
developed�by�Thomas�J.�McCabe,�Sr.�in�
1976
For�this�strongly�connected�control�
flow�graph,�Cyclomatic�complexity�=�3�
is�the�number�of�linearly�independent�
cycles�that�exist�in�the�graph,�i.e.�those�
cycles�that�do�not�contain�other�cycles�
within�themselves.
21/39