OnlineWoerterBuecher.de
Internes

Lexikon


cyclomatic complexity


A measure of the number of linearly independent paths through a program module. Cyclomatic complexity is a measure for the complexity of code related to the number of ways there are to traverse a piece of code. This determines the minimum number of inputs you need to test all ways to execute the program. (1998-03-17)

In addition suitable contents:
[ = ] [ al ] [ am ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ b ] [ be ] [ C ] [ ch ] [ cl ] [ co ] [ code ] [ com ] [ complexity ] [ cu ] [ Cyc ] [ Cyclo ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ exec ] [ execute ] [ fi ] [ file ] [ fo ] [ for ] [ gh ] [ gr ] [ h ] [ hr ] [ hs ] [ id ] [ ie ] [ il ] [ in ] [ input ] [ is ] [ it ] [ la ] [ Lex ] [ li ] [ line ] [ ly ] [ ma ] [ measure ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ na ] [ ne ] [ ng ] [ ni ] [ np ] [ nu ] [ om ] [ pa ] [ path ] [ pe ] [ ph ] [ pl ] [ pr ] [ program ] [ programming ] [ query ] [ rave ] [ rc ] [ re ] [ rl ] [ ro ] [ se ] [ st ] [ su ] [ T ] [ test ] [ testing ] [ th ] [ to ] [ tr ] [ traverse ] [ ug ] [ um ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2931 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0967 Seconds, with 17 Database-Queries
Zurück zur Startseite