Design and Code Complexity Metrics for OO Classes

Letha Hughes Etzkorn, Jagdish Bansiya, Carl G. Davis · 2003

classes consisting solely of virtual functions classes with a number of member functions, where one particular member function was much more complex than the other member functions. In the case of a class consisting solely of virtual functions, the following problems were identified for each metric: The code complexity WMC metric, since it calculates the McCabe’s cyclomatic complexity for each member function, calculates an empty virtual function as cyclomatic complexity = 1. Thus empty virtual functions add to the complexity measure of a class. The AMC metric has a similar problem, although due to the averaging nature of the metric the problem is not as bad as with

Read the paper · More papers on PaperTik