{'fraction_non_alphanumeric': 0.022700119474313024, 'fraction_numerical': 0.009557945041816009, 'mean_word_length': 5.028776978417266, '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}}
LGES: A Large Graph Embedding System

Many convenient graph drawing tools have been developed to visualize the relational information among the large massive data sets. This paper presents a new system for drawing large undirected graphs in the two-dimensional and three-dimensional space, called LGES. It employs a fast novel algorithm to beautify the layouts, which adopts the multi-level method as the framework of the algorithm, and uses the improved force-directed algorithm to refine the single-level layouts. Experiments prove its high performance and nice results. It takes around 5 seconds to draw 10,000 vertex graphs in the two- dimensional space and around 40 seconds in the three- dimensional space. Moreover, the independent components provided by the LGES system are attractive for its further development and application.