Combinatorial Study of DFS and BFS Algorithms
Loading...
Files
Date
2015-12-18T07:11:35Z
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this project, we propose an improved technique for synthesizing a searching algorithm based on a combined breadth-first search (BFS) and depth-first search (DFS) algorithm.
A method based on DFS alone may often take a long time to converge, whereas, a BFS based method requires a large amount of memory for searching. To strike a balance between these two approaches, we propose a hybrid BFSDFS based synthesis algorithm that reduces the computation time when compared to the DFS method and requires less space compared to the BFS method.
The technologies used in the system are Eclipse Juno which is an integrated development environment (IDE) for development of code in Java, was a very helpful and interactive tool. We also make use of MySQL as a database system. We make use of Apache Tomcat 7.0 for server operations.
Description
Keywords
Combinatorial Study of DFS and BFS Algorithms, Radha N Permi, Naren, Lakshya Kalyani, Anitha R