Journal of Systems Integration

, Volume 10, Issue 4, pp 395–409 | Cite as

Computing Cyclomatic Complexity with Cubic Flowgraphs

  • Yongming Tang
  • Ali H. Dogru
  • Franz J. Kurfess
  • Murat M. Tanik


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. M. Tanik and E. S. Chan, Fundamentals of Computing for Software Engineers, Van Nostrand Reinhold, 1991.Google Scholar
  2. 2.
    A. H. Dogru and I. Altintas, “Modeling language for component-oriented software engineering: COSEML,” The Fifth World Conference on Integrated Design and Process Technology, Dallas, Texas, June 4–8, 2000.Google Scholar
  3. 3.
    T. McCabe, “A complexity measure,” IEEE Transactions on Software Engineering, SE-2(4), pp. 308–320, 1976.Google Scholar
  4. 4.
    R. Prather, “Design and analysis of hierarchical software metrics,” ACM Computing Surveys 27(4), pp. 497–518, 1995.Google Scholar
  5. 5.
    R. Prather, “Regular expressions for program computations,” The American Mathematical Monthly 104(2), pp. 120–130, 1997.Google Scholar
  6. 6.
    S. Muchnik and N. D. Jones, Program Flow Analysis. Prentice Hall Inc.: Englewood Cliffs, NJ, 1981.Google Scholar
  7. 7.
    A. Gibbons, Algorithmic Graph Theory, Cambridge University Press: Cambridge, England, 1985.Google Scholar
  8. 8.
    M. Tanik, U. Pooch, and S. Yurttas, Advanced Programming Techniques in TURBO PASCAL, pp. 237–283, Wordware Publishing, Inc.: Plano, Texas, 1988.Google Scholar
  9. 9.
    Y. Tang, A Methodology for Component-based System Integration, Ph.D. Dissertation, New Jersey Institute of Technology, Newark, New Jersey, January 1999.Google Scholar
  10. 10.
    Y. Tang, A. Dogru, and M. Tanik, “Cyclomatic complexity based on cubic flowgraphs,” The Third Conference on Integrated Design and Process Technology, Berlin, Germany, IDPT, 4, pp. 82–85, July 6–9, 1998.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Yongming Tang
    • 1
  • Ali H. Dogru
    • 2
  • Franz J. Kurfess
    • 3
  • Murat M. Tanik
    • 4
  1. 1.School of Computer Science and Information SystemsFairleigh Dickinson UniversityTeaneckUSA
  2. 2.Computer Engineering DepartmentMiddle East Technical UniversityAnkaraTurkey
  3. 3.Computer Science DepartmentConcordia UniversityMontrealCanada
  4. 4.Department of Electrical and Computer EngineeringThe University of Alabama at BirminghamBirminghamUSA

Personalised recommendations