Advanced Algorithms Analysis and Design - Lecture 29: Proof (Breadth first search algorithm) & Depth first search. In this lecture we will cover the following: depth first search techniques is discussed; algorithms is designed; correctness of depth first search is given; topological sort and its benefits; computing strongly connected components; applications and conclusion; . |