You shared guidelines numbers for cyclomatic complexity? In the context of a codebase, what level of abstraction should this number be measured at? Method/Function level? Class level?
How do we get “P” in the formula? In the context of a control flow diagram, I’m not sure what an “unconnected part” is. Can you provide a functional definition of this?
I think it means that in some function there are two individual, unconnected flows, in the examples shown in the video, there is only one graph, it is alone and by definition "unconnected" to other graphs hence p = 1
