Author(s): Swaroop Prakash Jadhav
In this paper we are going to focuses on graph traversal algorithm BFS and DFS. 1) BFS (Breadth First Search) or sometimes it is also known as level order traversal and 2) DFS (Depth First Search). This research paper provides a study of graph and its traversal, based on BFS and DFS briefly. And also defines its applications where these traversals are helpful in graph theory