An Algorithm of System Decomposition Based on Laplace Spectral Graph Partitioning Technology

In this paper we propose a spectral-graph-partitioning-based algorithm to decompose an object-oriented system into components. We begin with a weighted class dependence graph, in which vertexes stand for the classes and edges stand for the weight of the relationship between classes. We employ a technology from algebraic graph theory known as Laplace spectral graph partitioning to divide the class graph into components. The decomposition algorithm can be performed automatically and achieve a good performance.