{'fraction_non_alphanumeric': 0.01405152224824356, 'fraction_numerical': 0.0, 'mean_word_length': 4.783783783783784, '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 new channel routing algorithm based on Steiner minimum tree

In this article, we propose a new channel routing algorithm based on the Steiner minimum tree for a fixed amount of routing channels. By adding some doglegs and changing the order of routing, the algorithm can sufficiently use the channel resources. Quick and efficient channel routing can be implemented by using this algorithm. A routing sample is also provided.