{'fraction_non_alphanumeric': 0.015558698727015558, 'fraction_numerical': 0.0, 'mean_word_length': 5.103448275862069, '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}}
REPRESENTATION BY STRUCTURE OF SPANNING TREE

The most effective representation of the class of ordinary graphs (in the sense of in-formation capacity) is representation of the structure of the trees. The paper considers the different ways of the graphs assignments. The theorem on the possibility of networks representation by a tree structure is given. In proving this theorem the necessary and sufficient conditions compliance with their representation is formulated. The issues of representations transformation are considered. An example of network coding is given. The network can be set by any tree representation if this represen-tation sets a tree accurate within the numbering of all its vertices.