-
…in reply to @getify
getify Cyclomatic complexity is about linearly independent *source code* paths. The output is - technically - irrelevant. Here's a little flowchart demonstrating the 2 claused paths (and the third is the non-guarded paths outside the if statements.
-
…in reply to @rockerest
getify You can be more explicit about that third path. Note that - here - the graphing tool can't combine the paths before they hit the node (noop). That would be the appropriate representation since it's not two discrete paths (e.g. linearly indepedent); it's the same execution.

