{'fraction_non_alphanumeric': 0.03098106712564544, 'fraction_numerical': 0.0, 'mean_word_length': 5.613636363636363, '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}}
Comparison Study of Three Shortest Path Algorithm

This paper introduces the algorithm procedure of three common shortest path algorithms in detail, i.e. Dijkstra, Floyd, and Bellman-Ford. Through testing case diagrams, it describes the execution steps of the three algorithms. From spatial complexity, time complexity, application range and negative weight (negative weight value), this paper compares the three algorithms and draws a conclusion. When selecting the shortest path algorithm, it's required to consider actual circumstances and the characteristics of each algorithm.