ScholarGate
Msaidizi
Machine learningSoftware Metrics

Ugumu wa Mzunguko (Cyclomatic Complexity)

Ugumu wa Mzunguko (CC), ulioanzishwa na Thomas McCabe mwaka 1976, ni kipimo cha kiasi kinachopima idadi ya njia zinazojitegemea kimstari kupitia grafu ya udhibiti wa utendaji kazi. Utendaji kazi wenye ugumu wa mzunguko wa juu ni mgumu zaidi kueleweka, kupimwa, na kudumishwa; McCabe alitetea kiwango cha 10 kama kikomo cha ugumu kwa uwezo wa kudumisha.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Ugumu wa Mzunguko (Cyclomatic Complexity)
Halstead ComplexityVipimo vya CK

Vyanzo

  1. McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, SE-2(4), 308–320. DOI: 10.1109/TSE.1976.233837
  2. Campbell, G. H. (1986). Defining a good metric, a software testing perspective. ASQ Software Quality Conference. link
  3. Nagy, C., & Kriebel, K. (2001). Achieving optimal complexity and reliability. SAMS Publishing. ISBN: 0672322285

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 3). Cyclomatic Complexity Metric. ScholarGate. https://scholargate.app/sw/numerical-methods/cyclomatic-complexity

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Imerejelewa na

ScholarGateCyclomatic Complexity (Cyclomatic Complexity Metric). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/numerical-methods/cyclomatic-complexity · Seti ya data: https://doi.org/10.5281/zenodo.20539026