NAME
Analizo::Metric::AverageCycloComplexity - Average Cyclomatic Complexity per Method (ACCM) metric
DESCRIPTION
The metric calculation is based on the following article and calculates the complexity of the program.
Article: Monitoring of source code metrics in open source projects by Paulo Roberto Miranda Meirelles.
See the adaptation of the paragraph about Average Cyclomatic Complexity per Method in the article:
... The cyclomatic complexity of a graph can be calculated using a formula of graph theory:
v(G) = e - n + 2
where e
is the number of edges and n
is the number of nodes of the graph.