{'fraction_non_alphanumeric': 0.014301430143014302, 'fraction_numerical': 0.0, 'mean_word_length': 4.947712418300654, '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}}
Optimal Route Searching in Networks with Dynamic Weights Using Flow Algorithms

A network with dynamic weights implies a set of vertices interconnected by a set of edges, each of which bears a weight that changes with time. One example of such networks is a traffic network, wherein, the structure of the graph remains constant but the weight on the edges, signifying the amount of traffic (traffic density) changes over time. We have dealt with scenarios where flow algorithm needs to run repeatedly to establish flows in a network with timely changing capacities and we have sought to obtain some form of computational intelligence on that subject. We have aligned our work to the context of traffic networks in order to explore practical inspection of the same. However, this study applies equally for any generic network with continuously changing capacities which requires flow re-setting time and again.