- This metric was developed by Thomas J. McCabe in 1976 and it is based on a control flow representation of the program. For the original paper here . Edges represent control flow between the nodes.
- One more thing on cyclomatic complexity. Occasionally, you might hear
someone argue that the actual formula for McCabe’s cyclomatic complexity is
C = E - N + P
whereas we list it as
C = E - N + 2P
E = Edge
N = Nodes
