Revision as of 09:23, 23 December 2021 edit Citation bot (talk \| contribs) Bots 5,865,889 edits Add: s2cid. \| Use this bot. Report bugs. \| Suggested by BrownHairedGirl \| Linked from User:BrownHairedGirl/Articles_with_new_bare_URL_refs \| #UCB_webform_linked 1041/2170 ← Previous edit		Revision as of 20:57, 9 January 2022 edit undo 589q (talk \| contribs) Extended confirmed users 6,471 edits inserted missing volume in the reference Next edit →
Line 16: Mathematically, the cyclomatic complexity of a [[Structured programming\|structured program]]{{efn\|1=Here "structured" means in particular "with a single exit ([[return statement]]) per function".}} is defined with reference to the [[control-flow graph]] of the program, a [[directed graph]] containing the [[basic block]]s of the program, with an edge between two basic blocks if control may pass from the first to the second. The complexity '''M''' is then defined as<ref name="mccabe76">{{cite journal\| last=McCabe\|date=December 1976\| journal=IEEE Transactions on Software Engineering\|issue=4\| pages=308–320\| title=A Complexity Measure\| url=https://books.google.com/books?id=vtNWAAAAMAAJ&pg=PA3 \| volume=SE-2\| doi=10.1109/tse.1976.233837\|s2cid=9116234}}</ref> :''M'' = ''E'' − ''N'' + 2''P'',

Cyclomatic complexity: Difference between revisions