{'fraction_non_alphanumeric': 0.028277634961439587, 'fraction_numerical': 0.0, 'mean_word_length': 5.133858267716535, '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 Comparative Analysis among Three Different Shortest Path-finding Algorithms

The purpose of shortest route algorithms is to find a path having fewest weights between any two vertices along the edges. However, the shortest path problem may take many different forms, requiring the employment of many algorithms. In this paper, three of the shortest path finding algorithms are implemented and a comparative analysis is conducted among the three algorithms which are A* Search, Ant Colony Optimization (ACO), and Dijkstra. The parameters considered for comparative analysis are Run-time, Diagonal Movement, Complexity, Distance, Number of turns, and Number of visited nodes that are not in the path. For all the cases A* algorithm shows the best results except for the run-time.