Advanced Algorithms Analysis and Design - Lecture 28: Breadth first search. In this lecture we will cover the following: representation of graphs; breadth first search; supporting lemmas in the proof; proof of correctness; shortest paths, for un-weighted edges, based on breadth first search; . |