orangecrumbs
Loading the deck
Could not load the deck. Check the connection and reload.
Saved
orangecrumbs
✉ Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

✓
You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.
Full article HN thread
Cyclomatic complexity

Cyclomatic complexity

▲ 91 💬 49

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.

No items match this view.
Try Shuffle or New.
HN ↗
Loading comments…
List Mode
Cyclomatic complexity
Watch on YouTube

Cyclomatic complexity

↑↓to move·?shortcuts
▲ 91💬 49

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.

Full article HN thread
Open on HN ↗
Loading comments…
✉ Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

✓
You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.

Sort & filter

Sort
🔀 Shuffle
🕑 New
Upvotes
20+
50+
100+
200+
Type
All
Article
List