Journal of Systems Integration

, Volume 10, Issue 4, pp 395-409

First online:

Computing Cyclomatic Complexity with Cubic Flowgraphs

  • Yongming TangAffiliated withSchool of Computer Science and Information Systems, Fairleigh Dickinson University
  • , Ali H. DogruAffiliated withComputer Engineering Department, Middle East Technical University
  • , Franz J. KurfessAffiliated withComputer Science Department, Concordia University
  • , Murat M. TanikAffiliated withDepartment of Electrical and Computer Engineering, The University of Alabama at Birmingham

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building software by integration is a developing paradigm, especially enabled by the emerging component technologies. Decomposition of the design for a top-down approach is a prerequisite for this paradigm. Cubic flowgraphs are instrumental in providing formalisms for decomposition and integration. Cyclomatic complexity analysis of a design representation that is decomposable is the goal of this research. In addition to introducing cyclomatic complexity computation using cubic flowgraphs, preservation of cyclomatic complexity in the decomposition of the cubic flowgraph is also presented.

software engineering software metrics cyclomatic complexity flowgraphs cubic graphs software components