In this video, we learn about the BFS (Breadth First Search) algorithm, which is a graph traversal method that explores nodes level by level, starting from the source node. It’s contrasted with DFS (Depth First Search), which explores nodes depthwise. The video explains how BFS works with examples, showing how to traverse both connected and directed graphs. BFS is useful for checking if a graph is connected, finding the shortest path between nodes, and more.
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
FAQs
We curate free YouTube courses, organized by category and language — and make it easy for you to track your learning progress.
Yes. Free courses are embedded YouTube videos.
Currently available in English — with Portuguese, Spanish, French, German, and Italian coming soon.
Check ratings, reviews, duration, and description.
All courses include a certificate of participation.
Yes, an account lets you track progress, earn certificates, and save favorites.
We auto-save your watch position so you can resume on any device.
