In today’s lecture, we studied the Breath First Search (BFS) algorithm. The slides are now online.
Next lecture, we will consider a more general class of algorithms for computing the connected component of a vertex that includes BFS. We will prove the correctness of this more general algorithm (and hence, of the BFS algorithm). Then we will consider another special case of this general algorithm: depth first search (DFS). This material is from Section 3.2 in the book.
Advertisements
Leave a Reply