• Title/Summary/Keyword: cyclomatic number

Search Result 9, Processing Time 0.022 seconds

On Diameter, Cyclomatic Number and Inverse Degree of Chemical Graphs

  • Sharafdini, Reza;Ghalavand, Ali;Ashrafi, Ali Reza
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.3
    • /
    • pp.467-475
    • /
    • 2020
  • Let G be a chemical graph with vertex set {v1, v1, …, vn} and degree sequence d(G) = (degG(v1), degG(v2), …, degG(vn)). The inverse degree, R(G) of G is defined as $R(G)={\sum{_{i=1}^{n}}}\;{\frac{1}{deg_G(v_i)}}$. The cyclomatic number of G is defined as γ = m - n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

An Analysis of the Complexity Measurement Factor for a Program (프로그램에 대한 복잡도 측정인자 분석)

  • 이규범;송정영
    • Journal of Internet Computing and Services
    • /
    • v.3 no.4
    • /
    • pp.61-69
    • /
    • 2002
  • Measurement of the object, messages, clones, capsulation, inheritance, etc. that are conventional object-oriented paradigm characteristics as a method of measurement of the complexity of object-oriented programs has been reported. In this paper, the measures that are helpful to designing and coding of JAVA program, which is the representative language of object-oriented programs, are applied to six measures(i,e., Halstead's Program Volume, Program Level, Program Impurity, Macabe's Cyclomatic Number, Handerson-Seller's lock of cohesion in method and Sullivan's PVG.) suggested in the present study by referring to several actual programs as example for comparative analysis.

  • PDF

Relevance of the Cyclomatic Complexity Threshold for the Web Programming (웹 프로그래밍을 위한 복잡도 한계값의 적정성)

  • Kim, Jee-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.153-161
    • /
    • 2012
  • In this empirical study at the Web environment based on the frequency distribution of the cyclomatic complexity number of the application, the relevance of the threshold has been analyzed with the next two assumptions. The upper bound established by McCabe in the procedural programming equals 10 and the upper bound established by Lopez in the Java programming equals 5. Which numerical value can be adapted to Web application contexts? In order to answer this 10 web site projects have been collected and a sample of more than 4,000 ASP files has been measured. After analyzing the frequency distribution of the cyclomatic complexity of the Web application, experiment result is that more than 90% of Web application have a complexity less than 50 and also 50 is proposed as threshold of Web application. Web application has the complex architecture with Server, Client and HTML, and the HTML side has the high complexity 35~40. The reason of high complexity is that HTML program is usually made of menu type for home page or site map, and the relevance of that has been explained. In the near future we need to find out if there exist some hidden properties of the Web application architecture related to complexity.

A Quantitative Analysis of the Cyclomatic Complexity of the Web Software (웹 소프트웨어의 순환복잡도에 대한 정량적 분석)

  • Kim, JeeHyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.2
    • /
    • pp.183-191
    • /
    • 2014
  • In this study Cyclomatic Complexity of Web Software has been analyzed quantitatively by correlation between complexity and Number of Classes(NOC), and Number of Methods(NOM) which are object oriented programming measures. Based on the frequency distribution of complexity, NOC and NOM of software at the Web environment, correlation between complexity threshold and NOC threshold, and NOM threshold has been measured and more than 4,000 ASP files of 10 Web real projects have been used as the sample. The empirical result shows that NOC threshold is 21, NOM threshold is 40 and complexity threshold is 68 as high value, and 8 projects among of 10 except 2 projects with especially high frequency distribution shows that NOC threshold is 12, NOM threshold is 21 and complexity threshold is 52 with relatively low value, so correlation has been found out as exists. And also 8 projects with low threshold of complexity, NOC and NOM were internal management software, and the other 2 projects were external sales service software, Number of Classes and Number of Methods can be defined at the design stage according to business properties, and also the complexity can be estimated in order to improve the software quality.

The Software Classification by the Tolerance Rough Set (허용적 러프집합에 의한 소프트웨어 분류)

  • 김성애;최완규;이성주
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.2
    • /
    • pp.141-147
    • /
    • 2001
  • 소프트웨어의 측정값에 근거하여 소프트웨어 품질에 관한 의사결정을 할 때, 동치관계의 요구조건인 추이적(transitive) 특성이 항상 만족되는 것은 아니다. 순환수(cyclomatic number)가 거의 비슷한 프로그램에서, 하나의 \"구조적인\" 프로그램 범주에 속하고 또 다른 하나는 \"비구조적인\" 프로그램 범주에 속한다고 명확히 분류할 수 있는가하는 점이다. 따라서, 본 연구에서는 동치관계보다는 허용적 관계를 만족하는 허용적 러프집합에 근거한 소프트웨어 분류기준을 제시하고자 한다. 분류기준을 생성하기 위한 실험 데이터 집합을 수집하고, 집합 내의 각 원소에 관한 허용적 클래스들을 생성한 후, 각 허용적 클래스들의 중심값을 클러스터링하여 분류기준을 생성한다. 생성된 분류기준을 또 다른 실험 집합에 적용하여 비교 분석한 결과 생성된 분류기준이 타당함을 보여준다.생성된 분류기준이 타당함을 보여준다.

  • PDF

The Software Classification Criteria based on the Tolerant Rough Set (허용적 러프집합에 기반한 소프트웨어 분류기준)

  • 김상용;최완규;김영식;이성주
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.307-310
    • /
    • 2000
  • 소프트웨어의 측정값에 근거하여 소프트웨어 품질에 관한 의사결정을 할 때, 동치관계의 요구조건인 추이적(transitive) 특성이 항상 만족되는 것은 아니다. 순환수(cyclomatic number)가 거의 비슷한 프로그램에서, 하나는 "구조적인" 프로그램 범주에 속하고 또 다른 하나는 비구조적인 프로그램 범주에 속한다고 명확히 분류 할 수 있는가하는 점이다. 따라서, 본 연구에서는 동치관계보다는 허용적 관계를 만족하는 허용적 러프집합에 근거한 소프트웨어 분류 기준 제시하고자 한다. 분류기준을 생성하기 위한 실험 데이터 집합을 수집하고, 집합 내의 각 원소에 관한 허용적 클래스들을 생성한 후, 각 허용적 클래스들의 중심값을 클러스터링하여 분류기준을 생성한다. 생성된 분류기준을 또 다른 실험 집합에 적용하여 비교 분석하여 생성된 분류기준이 타당함을 보여준다.

  • PDF

Development of a Functional Complexity Reduction Concept of MMIS for Innovative SMRs

  • Gyan, Philip Kweku;Jung, Jae Cheon
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.17 no.2
    • /
    • pp.69-81
    • /
    • 2021
  • The human performance issues and increased automation issues in advanced Small Modular Reactors (SMRs) are critical to numerous stakeholders in the nuclear industry, due to the undesirable implications targeting the Man Machine Interface Systems (MMIS) complexity of (Generation IV) SMRs. It is imperative that the design of future SMRs must address these problems. Nowadays, Multi Agent Systems (MAS) are used in the industrial sector to solve multiple complex problems; therefore incorporating this technology in the proposed innovative SMR (I-SMR) design will contribute greatly in the decision making process during plant operations, also reduce the number MCR operating crew and human errors. However, it is speculated that an increased level of complexity will be introduced. Prior to achieving the objectives of this research, the tools used to analyze the system for complexity reduction, are the McCabe's Cyclomatic complexity metric and the Henry-Kafura Information Flow metric. In this research, the systems engineering approach is used to guide the engineering process of complexity reduction concept of the system in its entirety.

A Study of Estimation for Web Application Complexity (웹 어플리케이션의 복잡도 예측에 관한 연구)

  • Oh Sung-Kyun;Kim Mi-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.27-34
    • /
    • 2004
  • As software developing paradigm has been changing to complicate Web environment, study of complexity becomes vigorous. Yet still it seems that general agreement has not to be reached to architecture or complexity measure of Web application. And so traditional complexity metrics - program size(LOC) and Cyclomatic Complexity can be derived from the source code after implementation. it is not helpful to the early phase of software development life cycle - analysis and design phase. In this study 6 Web projects has been used for deriving applications with possible errors suited by Complexity Indicator. Using 61 programs derived, linear correlation between complexity, number of classes and number of methods has been proposed. As Web application complexity could be estimated before implementation, effort and cost management will be processed more effectively.

  • PDF

Regression Analysis of the Relationships between Complexity Metrics and Faults on the Telecommunication Program (통신 소프트웨어의 프로그램 결함과 복잡도의 관련성 분석을 위한 회귀분석 모델)

  • Lee, Gyeong-Hwan;Jeong, Chang-Sin;Hwang, Seon-Myeong;Jo, Byeong-Gyu;Park, Ji-Hun;Kim, Gang-Tae
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.11
    • /
    • pp.1282-1287
    • /
    • 1999
  • 통신 프로그램은 고도의 신뢰성과 기능성, 확장성, 그리고 유지 보수성이 필요하다. 프로그램 테스트의 결과와 McCabe의 Complexity를 측정한 데이타를 가지고 회귀모델을 만들고 그 신뢰성을 분석함으로서 프로그램의 결함과 복잡도의 관련성을 평가한다.본 연구에서 사용한 통신 프로그램은 500개 블록이 59가지 기능을 수행하는 교환 기능 중에서 복잡도가 너무 많아서 통계 처리의 bias가 될 블록을 제외하고 394 블록을 선정하여 SAS에 의해서 통계 분석을 하고 회귀 분석 모델을 설계하였다. t 분포에 의하여 방정식의 유의성 수준을 검증하고 프로그램의 결함수에 가장 큰 영향을 주고 있는 복잡도가 McCabe의 복잡도와 설계 복잡도 임을 밝혀냈다. 이 연구 결과에 의해서 설계 정보 및 유지 보수 정보를 얻을 수 있다. Abstract Switching software requires high reliability, functionality, extendability and maintainability. For doing, software quality model based on MaCabe's complexity measure is investigated. It is experimentally shown using regression analysis the program fault density depends on the complexity and size of the function unit. The software should be verified and tested if it satisfies its requirements with automated analysis tools. In this paper we propose the regression model with the test data.The sample program for the regression model consists of more than 500 blocks, where each block compose of 10 files, which has 59 functions of switching activity.Among them we choose 394 blocks and analyzed for 59 functions by testing tools and SAS package. We developed Regression Analysis Model and evaluated significant of the equation based on McCabe's cyclomatic complexity, block design complexity, design complexity, and integration complexity.The results of our experimental study are that number of fault are under the influence of McCabe's complexity number and design complexity.