Here’s what you should be reading and studying in the current unit on graph traversals:

• Read and review Section 2.5. Much of this is stuff you learned in an earlier class, but there may be new concepts and terminology.
• Review definitions, data structures, and algorithms from CS2150/CS216 slides. You’ve had this material before in lectures, labs and exams. I’ve put a copy of the slides on the Slides page of this website.
  • Read Sections 4.2 (DFS) and 4.3 (BFS) in the textbook
  • After this, we will do Section 4.4 (topological sort) and 4.5 (backtracking)
• Do HW4 (including the practice problems)