Cyclomatic complexity

/ˌsaɪkləˈmætɪk kəmˈplɛksɪti/ noun

A software metric that measures the number of independent execution paths through a program's source code. It counts decision points like if-statements, loops, and case statements to quantify code complexity.

Developed by Thomas McCabe Sr. in 1976, combining 'cyclomatic' (from graph theory, referring to the cycle rank of a program's control flow graph) with 'complexity.' The term draws from mathematics where cyclomatic number measures the complexity of a topological space.

AMሲክሎማቲክ kompleks
ARمعقدة دائرية
BNসাইক্লোম্যাটিক জটিলতা
CAcomplexitat ciclomàtica
CScyklomatická komplexita
DAcyklomatic kompleksitet
DEzyklische Komplexität
ELκυκλομετρική πολυπλοκότητα
EScompletitud cíclica
FAپیچیدگی سایکلومتریک
FIsyklomatiikan monimuotoisuus
FRcomplexité cyclique
📖 Full word page — etymology, 47 translations, audio 🔑 Get Free API Key — 50 lookups/day 📚 Read the Docs — integrate Word Orb