Abstract

Author(s): Chahat Monga, Richa

This paper focuses on Graphs Traversal Algorithms Breadth First Search (BFS) and Depth First Search (DFS) used in data structure and also gives an idea of complexity. The time complexity and space complexity are discussed here along with the O-notation. This research paper provides a study of graph, and its traversal based on BFS and DFS briefly and also define its applications where these traversals are helpful in graph theory.