Journal of Systems Integration

, Volume 10, Issue 4, pp 395–409

Computing Cyclomatic Complexity with Cubic Flowgraphs

Authors

  • Yongming Tang
    • School of Computer Science and Information SystemsFairleigh Dickinson University
  • Ali H. Dogru
    • Computer Engineering DepartmentMiddle East Technical University
  • Franz J. Kurfess
    • Computer Science DepartmentConcordia University
  • Murat M. Tanik
    • Department of Electrical and Computer EngineeringThe University of Alabama at Birmingham
Article

DOI: 10.1023/A:1011210102797

Cite this article as:
Tang, Y., Dogru, A.H., Kurfess, F.J. et al. Journal of Systems Integration (2001) 10: 395. doi:10.1023/A:1011210102797

Abstract

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 engineeringsoftware metricscyclomatic complexityflowgraphscubic graphssoftware components

Copyright information

© Kluwer Academic Publishers 2001