{'fraction_non_alphanumeric': 0.007575757575757576, 'fraction_numerical': 0.0, 'mean_word_length': 5.663865546218488, '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}}
An efficient route computation approach for large graphs

The problem of efficient routing arises in several applications such as transportation problems and network optimization. The increasing availability of large network data sets and the impact of networks on everyday life has set new standard to route computations, necessitating research for even faster and more accurate shortest path algorithms. A hierarchical graph model is developed based on an effective partition of graphs for decomposing the complex search problem. A new heuristic hierarchical routing algorithm is then proposed to significantly reduce the search space by pruning searches towards unpromising subgraph branches. Experimental results on New York City road network demonstrate the performance of the algorithm.