A Study of Class Structural Complexity in Object Oriented Software, Through a Fuzzy Graph Connectivity Analysis

Abstract

In this paper, for a class on object oriented programming, we represent its structure using directed graph in which each node corresponds to each member of the class. Then we quantify the dependence relationships among class members, with the weighted closure which is defined here. Using these quantified relationships, through fuzzy graph, we proceed to discuss class structural complexity.