A Novel Agent Based Depth First Search Algorithm

Artificial intelligent techniques provide different kind of searching methods in tree structure and those methods are implemented sequential and parallel manner using structured programming. Depth-first search is a tree search algorithm which enables the traversal from source node to neighbour nodes adjacent to source node in a graph and implemented sequentially in this fashion. The improvement of the sequential Depth-first search is sought in several research studies. One of the solutions to the improvement of Depth-first search is the design of multi agent system for the searching problem. In this research study, the proposed multi agent system for Depth-first search divides the entire graph into several clusters using bi-connected region method and consigns the agents to each cluster to perform the Depth-first search sequentially. The proposed method reveals the significance improvement in terms of the performance measure of the system than sequential Depth-first search.