{'fraction_non_alphanumeric': 0.01340033500837521, 'fraction_numerical': 0.0, 'mean_word_length': 5.361702127659575, '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}}
Comparison of the Work of Algorithms for Arranging Message Distribution Devices in Transport Networks

We study the problem of the optimal arrangement of warning devices on transport networks in order to transmit information about situations on the roads to the maximum number of traffic participants. A weighted graph is considered as a model of a transport network. Some restrictions have been introduced: the cost of installing warning devices, the transmission radius of devices, etc. A solution is proposed using several algorithms. Computational experiments using simulation are carried out.