{'fraction_non_alphanumeric': 0.01901743264659271, 'fraction_numerical': 0.0, 'mean_word_length': 5.252475247524752, '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 OF VARIOUS HEURISTIC SEARCH TECHNIQUES FOR FINDING SHORTEST PATH

Couple of decades back, there was a tremendous development in the field of algorithms, which were aimed at finding efficient solutions for widespread applications. The benefits of these algorithms were observed in their optimality and simplicity with speed. Many of the algorithms were readdressed to solve the problem of finding shortest path. Heuristic search techniques make use of problem specific knowledge to find efficient solutions. Most of these techniques determine the next best possible state leading towards the goal state by using evaluation function. This paper shows the practical performance of the following algorithms, to find the shortest path:Hill Climbing, Steepest-ascent, and Best-First and A*. While implementing these algorithms, we used the data structures which were indicated in the original papers.In this paper we present an alternative data structure multi-level link list and apply the heuristic technique to solve shortest path problem. This was tested for class of heuristic search family-- A* and Best First Search approaches. The results indicate that use of this type of data structure helps in improving the performance of algorithms drastically.