Pre-processed Depth First Search
In this paper, we present a new algorithm for the Depth first searchtraversing based on Hashing. The data in the nodes are stored in a hash table and corresponding identifier or key is stored in the tree. Thus, whatever might be the data; the entries in the tree will be only integral numbers. This pre processing mark existence and location of node before searching, this causes to faster searched results. Experimental results show that proposed algorithm is simpler and faster of traversing the graph that are repeatedly queried for different goals or paths. Implementation is carried out in Java, and compared with standard DFS and BFS.
KeywordsSearch algorithms software complexity breadth-first search depth-first search
Unable to display preview. Download preview PDF.
- 1.Naverniouk, I., Chu, F.: Graph algorithms, http://www.cs.cornell.edu/~wdtseng/icpc/notes/graph_part1.pdf
- 2.Chen, J.: Converter introductory graph theory part I, http://activities.tjhsst.edu/sct/lectures/graph1.pdf
- 3.From Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Breadth-first_search
- 4.From Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Depth-first_search
- 5.From Bioinformatics Wikidot, http://bioinformatics.wikidot.com/graph-theory-algorithms
- 6.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn., pp. 540–549. MIT Press, McGraw-Hill (2001); Section 22.3: Depth-first searchGoogle Scholar
- 8.Russel, S., Norvig, P.: Artificial intelligence, a modern approach (2003)Google Scholar
- 9.Kurant, M., Markopoulou, A., Thiran, P.: On the bias of BFS (Breadth First Search). International Teletraffic Congress, ITC 22 (2010)Google Scholar