{'fraction_non_alphanumeric': 0.014084507042253521, 'fraction_numerical': 0.0, 'mean_word_length': 5.522935779816514, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Decomposition Method for Object-Oriented Systems Based on Iterative Analysis of the Directed Weighted Graph

Aiming at the problem of how to acquire components from existing systems, this paper proposes a decomposition method for object-oriented systems based on iterative analysis of the directed weighted graph. This method uses the directed weighted graph as the representation of object-oriented systems, and an iterative algorithm for analyzing the independence of sub-graphs at different granularity levels. Those highly independent ones are chosen as candidate components. Experimental results show that this method is effective and can improve the existing decomposition methods in terms of accuracy.