Scholars Central

Research articlePublished 2018

Graph traversals and its applications in graph theory

Authors: Chahat Monga, Richa

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Computer Science and Mobile Applications.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Computer Science and Mobile Applications
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Chahat Monga”
  • BylineArticles whose byline prints “Richa”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels