{'fraction_non_alphanumeric': 0.01791359325605901, 'fraction_numerical': 0.0, 'mean_word_length': 5.1688311688311686, '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}}
Recursive Shortest Route Algorithm Using Abstract Data Type, Graph

The shortest route algorithm is an important algorithm in the mathematical sciences because it determines the most efficient route between two nodes in a network. Among the variants of the shortest route algorithm that are available, different data structures can be used to define the algorithm. The abstract data type, graph is one of the highly structured data structures or abstract data type that has important applications to mathematical and computer sciences. Mathematically, it can be defined as a collection of two sets, the set of nodes and the set or table/relation of edges. Recursive algorithm is very efficient when implemented, especially when the recursive case has one recursive call, it is also very structured when implemented. This paper presents a recursive design of the Dijkstra’s shortest route algorithm, using the operations of abstract data type, graph.