Аннотация

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.

Линки и ресурсы

тэги

сообщество

  • @jullybobble
  • @lillejul
  • @dblp
@jullybobble- тэги данного пользователя выделены