Cyclomatic complexity can be determined via static analysis, maybe we should have a rule for it? We already have a class to calculate it via an object.

I'm still slightly confused about it however. I may be getting a little off-topic here but my understand is that the number is how many paths I can go through.

However in our complexity, and codesniffers they don't count "else" I assume this is because `else` has tokens `T_ELSE` and `else if` has both `T_ELSE` and `T_IF` which might result in double counting unless we check if it's followed immediately by a space and `T_IF`.

We are also counting all `T_CASE` tokens as a path, but every case may not be a different path:

~~~ php
switch(true) {
	case 1:
	case true:
		foo();
	break;
	default:
		baz();
	break();
}
~~~

This has 3 cases, but 2 paths to go through. Is a simple count 'good enough'? Or should we go a little further and also check context here as well?