CSE201, WInter 2025, Lec 4: Depth First Search
C. Seshadhri · 87:27
This lecture builds DFS from a simple recursive walk into a timed traversal whose discovery/finish stamps form a parenthetical forest, then uses that structure to set up cycle detection in directed graphs and topologi...