Ask, Learn and Accelerate in your PhD Research

image Post Your Answer


image

Depth first search vs breadth first search algorithm

5 years ago in PhD Concept paper By Vishwas Rao


All Answers (4 Answers In All) Post Your Answer

By Raghu Answered 5 years ago

I don’t know much about breadth first search algorithm.  In depth first search algorithm. It is an algorithm used for searching or traversing tree or graph data structures.


By Pooja Answered 5 years ago

depth first search algorithm is used to transverse tree structures. It begins at the root node and explores along each branch before backtracking.  For eg, visit the link attached. https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/


By Shobha Answered 5 years ago

The depth and breadth-first search algorithm are almost similar. Both are used to search or transverse graph data structures.  The only difference is that it starts at the tree root and explores all of the neighbour nodes.  https://medium.com/basecs/breaking-down-breadth-first-search-cebe696709d9, https://www.youtube.com/watch?v=6mgIsZZT-Sk.   


By Meghna R Answered 5 years ago

This site gives you a detailed explanation on transversing process.  https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/    


Your Answer


View Related Questions