Video Example of depth first search (DFS) and breadth first search (BFS) graph algorithm
Author :
Javin Paul
Blog :TIBCO RV FIX PROTOCOL JAVA TUTORIAL
Date: 6/14/2012 3:43:00 PM
Breadth first Search (BFS) and Depth first search (DFS) algorithm are two most important graph and tree algorithm used for traversal. you can traverse all nodes of tree or graph by using BFS or DFS. Even though most of us learn about Breadth first search and depth first search in college its not easy to understand and it takes time to grasp the concept and I believe that once you understand how BFS or DFS works its easy to implement logic in Java or C++ but trying to implement or copy code without first understanding the algorithm is not going to work. I have read about BFS and DFS in text books, Wikipedia and several other places but never find an explanation as shown in this video. My friend got this video on YouTube few years back while revising concept of BFS and DFS while preparing for programming interview and data structure and shared with me that this is very simple, clear and concise. So I thought to share this BFS and DFS search video with you guys. This video explains How depth first search algorithm works with detailed example and stack data structure along with How breadth first search algorithm works with queue in simple words and live example of Breadth first search. if you are looking for code example than check out our last post Breadth first search in java code example