Cyclomatic complexity

Cyclomatic complexity

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Cyclomatic complexity”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Cyclomatic complexity to your collection.

Play for free

Related cards