{'fraction_non_alphanumeric': 0.019538188277087035, 'fraction_numerical': 0.0, 'mean_word_length': 5.482758620689655, '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}}
Recursive algorithm for routing analysis in unidirectional flow networks

This paper proposes a novel recursive algorithm, towards finding all routing paths in an unidirectional flow- network. The algorithm is recursive, so it provides a flexible approach comparing to iterative methods. Initially, all the paths from source to destinations are identified and represented in a two-dimensional matrix. The recursive algorithm uses the concept of blanking patterns, by identifying definite patterns of combinations of rows and columns in the two-dimensional matrix.