Wikipedia Article of the Day
Randomly selected articles from my personal browsing history
Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976. Cyclomatic complexity is computed using the control-flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program. One testing strategy, called basis path testing by McCabe who first proposed it, is to test each linearly independent path through the program; in this case, the number of test cases will equal the cyclomatic complexity of the program.
History
Oct 4
Lactate threshold
Oct 3
Fairness doctrine
Oct 2
Castle Valley, Utah
Oct 1
2020 Utah gubernatorial election
Sep 30
Tunguska event
Sep 29
Lexicographic order
Sep 28
Cross-site request forgery
Sep 27
Progressive web app
Sep 26
Gerrymandering in the United States
Sep 25
Poisson distribution
Sep 24
Dyatlov Pass incident
Sep 23
Dyatlov Pass incident
Sep 22
Fanum tax
Sep 21
Pollard's p − 1 algorithm
Sep 20
Joe Lo Truglio
Sep 19
Ricky Schroder
Sep 18
Double-entry bookkeeping
Sep 17
Relativistic electromagnetism
Sep 16
97 (number)
Sep 15
Binomial distribution
Sep 14
Analemma
Sep 13
Marvin Heemeyer
Sep 12
Karatsuba algorithm
Sep 11
Ramer–Douglas–Peucker algorithm
Sep 10
Cross-site scripting
Sep 9
Happy Hacking Keyboard
Sep 8
Salted Challenge Response Authentication Mechanism
Sep 7
KHive
Sep 6
Interplanetary Internet
Sep 5
KHive