Day 22: mat385

• Announcements
  • Your homework 5.3 is returned: graded 5, 10, and 12.
  • Your project proposal is due today.
  • Your exams are returned:
    • Your score is out of 40 (since you skipped one).
    • Add 2 to your raw score as a curve.
    • The Exam
    • The Key

• Today we'll finish section 6.3: Shortest Path and Minimal Spanning Tree.

• then we move on to section 6.4: Traversal Algorithms (we want to see how they behave on trees);

Links:

• An example of the traveling salesman problem, in action
• Details of the workings of Dijkstra's algorithm, Bellman-Ford, and Floyd's algorithm.
• An animation of Dijkstra's algorithm (without stated destination node)