BFS Algorithm | Breadth First Search Algorithm for Graph Search
This video will cover the BFS algorithm, which is a shortcut for breadth first search.
This is one of the core graph algorithms in Computer Science. Other known and important algorithms use similar concepts to BFS, such as Prim and Dijkstra, so having a good understanding of how BFS works will serve you well when exploring more advanced algorithms.
The video will start by shortly exploring the idea of BFS and what output it provides, important one being the shortest path between a source vertex to all other vertices on a graph.
Then the video will review a pseudo code for the algorithm and discuss its time and space complexity.
The algorithm assumes the graph is represented using adjacency lists. If you'd like to learn more about adjacency lists, here is a link to a video that covers this topic - • Graphs Representations - Adjacency Lists v...
To make the concepts of the algorithm clear, the video will then show a very extensive BFS run on an example graph. Finally, we'll see how to retrieve a shortest path using the output from BFS.
0:00 Introduction and Motivation
1:45 The Algorithm Pseudocode
4:12 Time Complexity
5:10 Space Complexity
5:30 Example Run
11:31 Retrieve a Path