CSE201, Winter 2025, Lec 2: The BFS Theorem
C. Seshadhri · 86:31
BFS returns a visited array and a predecessor array from a source \(S\); when the algorithm runs to completion on an undirected graph, those arrays encode connectivity and a shortest-path tree, and the reason a queue...