(12) DUE: Thursday, January 21

• Read page 267 - Kruskal's algorithm.
• 5.5 Do: 10, 11, 12, 13
  

(11) DUE: Wednesday, January 20

• Read 5.5: pg. 263 - 266
• DO: 1 - 5, 7, 8
  

(10) DUE: Tuesday, January 19

• Trip Planner Project
• Follow sheet.
• Typed answers so preferred.

• Take Home midterm: DUE Monday, January 25.

• Lates midterms: - 10 points/day.
• Sign that work totally independently.
  

(9) DUE: Friday, January 15

• Bring in deck of playing cards
• Portfolio page for Weighted Graphs (cycle vs. tree)
  

(8) DUE: Thursday, January 14

• Read 5.4
• Do: 3, 4, and 14
• Quiz on Traveling Salesman Problem
  

(7) DEU: Wednesday, January 13

• Read 5.3
• Do: 5.3 ((5) and (7) using Dijkstra and (8))
• Portfolio page for Traveling Salesman Problem -- Use ALL THREE methods!
  

(6) DUE: Tuesday, January 12

• Do 5.2 (8) Use Nearest Neighbor and Sorted Edges algorithms
• Do 5.3 (5) and (7) with Nearest Neighbor