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
Dec 21
Poisson point process
Dec 20
Generic top-level domain
Dec 19
Beale ciphers
Dec 18
Heavyweight (podcast)
Dec 17
MurmurHash
Dec 16
Attempted assassination of Ronald Reagan
Dec 15
Mnemonic major system
Dec 14
Peter M. Lenkov
Dec 13
Lagrange polynomial
Dec 12
Polynomial interpolation
Dec 11
Newton polynomial
Dec 10
Quantile function
Dec 9
Static site generator
Dec 8
Flag Day (United States)
Dec 7
Seven-segment display character representations
Dec 6
Tori Kelly
Dec 5
Lynn Conway
Dec 4
G7
Dec 3
Nostr
Dec 2
Negative binomial distribution
Dec 1
Toledo War
Nov 30
Laurent series
Nov 29
Interface control document
Nov 28
ANT (network)
Nov 27
Functional analysis
Nov 26
Semiring
Nov 25
Projective set (disambiguation)
Nov 24
Primitive polynomial
Nov 23
Syphilis
Nov 22
Mud dauber