In the coverage count description page
https://www.eclemma.org/jacoco/trunk/doc/counters.html
one can read:
The formal definition of the cyclomatic complexity v(G) is based on the
representation of a method's control flow graph as a directed graph:
v(G) = E - N + 2
but I think this is correct only if the graph has a single exit node.
Otherwise, this is incorrect.
I hope this is only a documentation issue and it is not used to compute the
complexity of our programs.
Dela
--
You received this message because you are subscribed to the Google Groups
"JaCoCo and EclEmma Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to jacoco+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/jacoco/0398b4f8-7029-4996-88c7-d9ecf79a60dfn%40googlegroups.com.
