{'fraction_non_alphanumeric': 0.02107728337236534, 'fraction_numerical': 0.00117096018735363, 'mean_word_length': 5.286764705882353, '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}}
Research on Fast KCSP Algorithms for Searching Connecting Paths in Airline Networks

With the rapid development of the civil aviation industry in the world, airline networks become increasingly complex and large, which provide more choices for passengers. To search in airline networks for better connecting paths, it is very time-consuming by existing general K Constrained Shortest Paths (KCSP) algorithms. According to that the acceptable transfer times is generally not more than 3, combined with the structure characteristics of the Yen algorithm, a fast algorithm named as KCSP_Yen is proposed for searching connecting paths in airline networks. At the same time, based on the bounded breadth-first search and A* search, two fast KCSP algorithms are proposed. Finally, the three algorithms are test through experiments on the world airline network.