Day 21: mat385

Today:

• Announcements
  • Homework for section 5.2 returned: 8, 9, 17, 25 (draw the tree!)
  • Homework for section 5.3 due.
  • Homeworks for sections 6.2 and 6.3 will be turned in with the exam.
  • FYI: next exam is Wednesday, 11/17. The exam will go through 6.2 and 6.3.
  • Your second project: Huffman Tree Encoding (due 11/29)

    You guys are lucky: the class before you put together a great set of resources. Have fun! Do something different, and interesting: don't just repeat something that another student did from a previous semester.

  • An interesting application of expression trees: Chaotic Dynamical Systems (and the laws that drive them), modeled using trees to store models.

• Last time we were working on section 6.2, on graph algorithms:
  • section 6.2 highlights: Euler Paths and Hamiltonian Circuits
  Let's wrap that up....

• Today we look at Section 6.3:
  • section 6.3 highlights: Shortest Path and Minimal Spanning Tree
  • There are some more details here, as we step through some examples using our author's notation.

Links

• Dijkstra's photo
• Dijkstra Applet
• Dijkstra Applet
• Dijkstra Applet