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 - (2971 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0885 Seconds, with 16 Database-Queries
Zurück zur Startseite