Day 21: mat385

• Announcements
  • I'm returning 5.3 homework:
    • 10 -- straightforward -- but do you have a plan for filling the search tree?
    • 12 -- repeats are not repeated. Capitals matter?
    • 17 -- there's a lovely symmetric, binary tree solution -- Michelle, Jaime, Matt?

  • I'm collecting 6.1 homework today.

  • Let's make project II due Monday, 12/5.

• Last time we looked at section 6.3: Shortest Path and Minimal Spanning Tree

  Let's take a last look at the minimal spanning tree....

• Today we'll check out section 6.4: Traversal Algorithms

Links:

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