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.
Apr 19
Apr 18
Apr 17
Quaternions and spatial rotation
Apr 16
Affine transformation
Apr 15
Heidi Gardner
Apr 14
Learning with errors
Apr 13
Apr 12
Accounting identity
Apr 11
Watchdog timer
Apr 10
Rotation matrix
Apr 9
Three Nephites
Apr 8
Spherical coordinate system
Apr 7
Mormon folklore
Apr 6
Homogeneous coordinates
Apr 5
Apr 4
Counter (digital)
Apr 3
Apr 2
Matter (standard)
Apr 1
Network layer
Mar 31
Mar 30
Clock generator
Mar 29
Near-field communication
Mar 28
ISO/IEC 14443
Mar 27
Near-field communication
Mar 26
CPU multiplier
Mar 25
Stress (linguistics)
Mar 24
Mar 23
Mar 22
Heavenly Mother (Mormonism)
Mar 21
Harald Cramér