ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

GRAPH TRAVERSALS AND ITS APPLICATIONS IN GRAPH THEORY

Journal: International Journal of Computer Science and Mobile Applications IJCSMA (Vol.6, No. 1)

Publication Date:

Authors : ; ;

Page : 38-42

Keywords : BFS; DFS; complexity; Graphs;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

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.

Last modified: 2018-01-13 15:55:22