title: How is cyclomatic complexity counted?
body: <p>I'm reading Kent Beck's “TDD by Example” and I can't understand why the cyclomatic complexity of his program is fractional.</p>
  
  <p><a href="https://i.stack.imgur.com/6lO8g.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/6lO8g.jpg" alt="Table from the book"></a></p>
  
  <p><a href="https://en.wikipedia.org/wiki/Cyclomatic_complexity?oldformat=true" rel="nofollow noreferrer">In Wikipedia</a> the complexity is defined as <code>M = E − N + 2P</code> where E, N and P are integers.</p>