I hope everybody is doing well.
Please note Exam 2 will be held next Thursday, July 7, and it will cover (i) Greedy Algorithms and (ii) graph algorithms; including definition and representation, traversal algorithms (BFS/DFS), and their applications (e.g., testing bipartiteness, strongly connected components, topology ordering, etc.). We will have a review of the exam contents in today’s lecture, and will also talk about a set of practice problems.
Also, note "shortest path algorithms for weighted graphs" will not be in this exam and will be covered in the final exam.
Please let me know if you have any questions.