Given a flow graph, the cyclomatic complexity gives the number of linearly independent paths in that graph. cyclomatic complexity can be calculated using the formula E - N + 2, where E is the no.of edges, N is the no.of nodes.
How is the above formula derived?
Aucun commentaire:
Enregistrer un commentaire