{'fraction_non_alphanumeric': 0.025048169556840076, 'fraction_numerical': 0.0009633911368015414, 'mean_word_length': 4.6775956284153, '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 Study on Calculating and Counting the Low-cost Paths in Bus Transportation Networks

Multiple low-cost paths may exist between two stops in a bus transportation network (BTN). In most previous studies, only the lowest-cost paths were considered. By fully taking account of all these paths, more accurate and effective results of BTN researches may be established. In this paper, we present a preliminary study on calculating and counting the low-cost paths in a BTN. Specifically, we present an algorithm of calculating the low-cost paths between two arbitrary stops in BTNs, which takes account of both the bus riding edges and short-distance walking edges. Besides, a case study based on the BTN of Hangzhou in China of analyzing the number of the low-cost paths with transfer times less than 3 is given. Results show that the number of the low-cost paths between two stops increases exponentially with passengers' tolerance degree to the travel cost, and the number is sensitive to the factors of transfer-times and walking distance.