Cyclomatic complexity: Difference between revisions

Revision as of 15:15, 22 December 2023

Revision as of 05:42, 27 December 2023

Line 67:

<math display="block">M := b_1(G,t) := \operatorname{rank}H_1(G,t),</math>

which is read as "the rank of the first [[Homology (mathematics)|homology]] group of the graph ''G'' relative to the [[Tree (data structure)|#Terminology|terminal nodes]] ''t''". This is a technical way of saying "the number of linearly independent paths through the flow graph from an entry to an exit", where:

* "linearly independent" corresponds to homology; backtracking is not double-counted

* "paths" corresponds to first homology; a path is a one-dimensional object