CSE 201, Winter 2025: Lec 1, graph traversals
C. Seshadhri · 78:33
This lecture introduces graph traversals by arguing that shortest-path answers on even small graphs need a formal correctness argument, then develops BFS: its real output is a shortest-path tree, the FIFO queue is wha...