Sunday, March 24
In Class: 6.1 Hamilton Paths and Hamilton Circuits
Homework: Ch.6 2-16 evens
Tuesday, March 26
In Class: 6.2 Complete Graphs
Homework: Ch.6 18-28 evens
Thursday, March 28
In Class: 6.3 & 6.4 Traveling Salesman Problems
Homework: none
Monday, April 1
In Class:
Homework:
Wednesday, April 3
In Class: 6.5 Brute Force & Nearest Neighbor Algorithms
Homework: Ch.6 30-36 evens, skip 34c
*~Spring Break~*
Monday, April 15
In Class: 6.7 Repetitive Nearest Neighbor Algorithm
Homework: Ch.6 38-42 evens
Thursday, April 18
In Class: 6.8 The Cheapest Link Algorithm
Homework: Ch. 6 44-48 evens
Monday, April 22
Wednesday, April 24
In Class: 6.1 Hamilton Paths and Hamilton Circuits
Homework: Ch.6 2-16 evens
Tuesday, March 26
In Class: 6.2 Complete Graphs
Homework: Ch.6 18-28 evens
Thursday, March 28
In Class: 6.3 & 6.4 Traveling Salesman Problems
Homework: none
Monday, April 1
In Class:
Homework:
Wednesday, April 3
In Class: 6.5 Brute Force & Nearest Neighbor Algorithms
Homework: Ch.6 30-36 evens, skip 34c
*~Spring Break~*
Monday, April 15
In Class: 6.7 Repetitive Nearest Neighbor Algorithm
Homework: Ch.6 38-42 evens
Thursday, April 18
In Class: 6.8 The Cheapest Link Algorithm
Homework: Ch. 6 44-48 evens
Monday, April 22
Wednesday, April 24
Notes...
|
|
|
|
|
|