Abstract from our ISREE'03 paper:

This project includes the design and implementation of a Class Ordering System that's driven by a parameterized cost model. The parameters to the model assign weights to the edge types that describe the relationships between the classes in a graph representation of the program. The nodes of the graph are classes and the edges express relationships between the classes. Our graph includes edges to accommodate the full complement of C++ language constructs including template classes and functions and nested classes. The parameters to our cost model can be tuned to remove certain types of edges in an attempt to reduce the cost of the testing effort (i.e., the number of stubs required to test the program) or to reduce the cost of breaking cycles in the graph. Our study shows that inclusion of inheritance edges in cycle breaking considerations may reduce the number of edge removals by a factor of two or more.