{'fraction_non_alphanumeric': 0.021518987341772152, 'fraction_numerical': 0.0, 'mean_word_length': 5.084615384615384, '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}}
Solving the Shortest Path Problem Using Integer Residual Arithmetic

The report considers solution to the problem of routing, the essence of which is to determine the shortest path length between any pair of computer network subscribers represented as an undirected graph, as one of the possible methods to increase the speed and performance of computer systems (CS). To carry out calculations and comparative analysis of the speed and productivity of CS in a positional binary number system (PNS) and in a non-positional number system in residual classes (residual number system-RNS), we consider one practical problem. Task is the routing problem, the essence of which is to determine the shortest path length, that is, to find the optimal data transmission route in the computer network.