Design and Analysis of a Reverse Hierarchical Graph Search Algorithm
Main Article Content
Abstract
During the process of searching for an element in Directed Acyclic graphs (DAGs), traditional search algorithms like Depth First Search (DFS) waste lot of time in backtracking. This paper presents an alternate search algorithm, known as the Reverse Hierarchical Search (RHS) algorithm, for DAG/tree data structures. The RHS algorithm promises better performance over the DFS algorithm by avoiding path retracing. This research puts focus on DAG/tree-like data structures with lineage elements. Based on the purpose the data structure solves, hierarchical tree structures have related elements that are organized in a certain way. The knowledge of the purpose of the data structure helps in creating a basic criterion for locating and adding new members. The RHS tree is based on searching for an element in a reverse hierarchical order. All nodes that are found in the search path are added to the solution space. To avoid crowding the solution space with revisited nodes, any previously visited node information is re-used and duplicity of nodes is prevented. This makes the RHS algorithm to be more scalable than DFS. In terms of run-time complexity, RHS is a better performer than the DFS algorithm for linear tree/ DAG data structures.
Â
Keywords: Hierarchical Search, Recursion, Directed Acyclic Graphs, Trees, Lineage Elements
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.