Skip to main content

On cyclomatic complexity

Not all of us are lucky to work with greenfield projects; the majority end up working with codebases that we inherit. These codebases have had their share of modifications that moved them away from the original elegant design: bug fixes, feature additions, and enhancements that were done in a hurry because of delivery pressure, without regard to code hygiene and future maintainability. The code then feels heavy, complex, hard to understand and more painful to maintain.

There are a lot of ways to characterize code complexity, but the one that jumps to mind is "cyclomatic complexity" described by the McCabe paper from 1976 http://www.literateprogramming.com/mccabe.pdf.  The paper describes how to measure the cyclomatic complexity of different program control paths, and recommends a bound of 10 for manageable code complexity. NIST also selects the same number http://hissa.nist.gov/HHRFdata/Artifacts/ITLdoc/235/chapter2.htm. The numbers, despite being arbitrary, provide a guideline to when to get out the scalpel, and start cleaning up the code.

I was curious about how our code fares, and luckily I found a lot of open source tools that help with that. For C/C++ programs "cccc" is good. If you're using the ports systems,

sudo port install cccc

does the trick. For Java code there are a lot of plugins for various IDEs, and for NetBeans, Simple Code Metrics is good. The plugin page shows that it is old and unmaintained, however it works perfectly in NetBeans 7.1. You choose a file or a package, and click the SCM icon, and it spits out metrics about the code including the cyclomatic complexity.

When I ran the tests, the results were an eye-opener. The good news is that most of the code has a complexity below 15, with the occasional function that is high up in the 30s. Not alarming, but definitely would need attention to keep the code hygiene high. The surprise came when I included some of the open source libraries that we use, and the numbers shot up as high as 206. When I talked to colleagues from other companies, the experiences were similar--most of the normal code hovers around 20, with the occasional function around 50, but no high alarming numbers like the 206 one.




Comments

Popular posts from this blog

Emacs on WSL2: From Monochrome Misery to Modern Elegance

Windows Subsystem for Linux (WSL) has come a long way—especially under Windows 11 . WSL2 now offers smooth integration for Linux graphical applications, making it feel less like a compatibility layer and more like a native experience. But if you're an Emacs user, you might have noticed something off. Launching Emacs under WSL can feel like stepping into a time machine. Tiny fonts, washed-out visuals, and a UI that evokes the green-and-amber glow of vintage terminals. Functional? Yes. Pleasant? Absolutely not. But here's the good news: it is easy to make Emacs under WSL2 look just as sharp and modern as it does on Mac OSX . The emacs-pgtk build is designed for better graphical integration under WSL. It uses the Pure GTK interface , which plays nicely with WSL’s GUI support. sudo apt install emacs-pgtk To make Emacs look great, we’ll use Windows’ rich font library. First, edit your font configuration: sudo emacs /etc/fonts/fonts.conf and add the Windows Font directory...

MacOS Catalina, OneDrive, and case sensitive file systems

Over the weekend, I dusted off my old Macbook Air to search for some old family photos. I have not used the laptop for a long time, and it was completely out of charge. I plugged it in, and it quickly booted. Shortly after, I got bombarded with notifications that many of the applications needed updating, and that a new version of the OS was available.   I waited till I found the photos I was looking for, before attempting to upgrade anything. I also wanted to install OneDrive to get my old files to the cloud, so that I can access them from any of my devices, instead of dusting off old computers to get to them. The MacOS upgrade experience has always been fantastic, and this one was no different. The OS upgrade files downloaded quickly and after a restart and a quick install, the Macbook Air was ready to go.   Upgrading the installed applications was also a breeze, however in the process I discovered that a large majority of the applications installed were not compatible ...

Randomized Algorithms: Polynomial equivalence

We are all accustomed to deterministic algorithms; we work with them every day, and feel comfortable in knowing that the results of running them are predictable, barring a coding error of course. The idea of randomized algorithms feels remote and uncomfortable, despite their usefulness and elegance.  There are a couple of great examples in the introductory chapters of the book " Probability and Computing " that are an eye opener. One is verifying polynomial identities: how can you tell that two different representations of polynomials are the same? For example, if we have two polynomials $P(x)$ and $Q(x)$, both of degree $d$ described by the following formulas: \[ P(x) = \Sigma_{i=0}^{i=d} a_i x^i \\ Q(x) = \Pi_{i=1}^{i=d} (x-b_i) \] how can we determine that they are the same polynomial? Intuitively we first check that the degrees are the same, then we could try to transform one form into the other, either by multiplying out the terms for $Q(x)$, collecting like t...