Presentation is loading. Please wait.

Presentation is loading. Please wait.

Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.

Similar presentations


Presentation on theme: "Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63."— Presentation transcript:

1 Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63

2 22.

3 24.

4 26. b.

5 42.

6 51

7 59

8 A garbage man intends to collect garbage from both sides of the street as he drives through city blocks. What is the minimum number of blocks that he will have to drive? (assume he can start and finish at different points) Draw a route for the garbage man so that he travels the minimum number of blocks S

9 A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting and ending at his hometown of A. The chart below shows the cost of a one way airline ticket between each pair of cities. What is the cheapest possible sequence in which to visit the five cities? Trip between:Cost A and B$185 A and C$119 A and D$152 A and E$133 B and C$121 B and D$150 B and E$200 C and D$174 C and E$120 D and E$199

10 A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting and ending at his hometown of A. The chart below shows the cost of a one way airline ticket between each pair of cities. What is the cheapest possible sequence in which to visit the five cities? Trip between:Cost A and B$185 A and C$119 A and D$152 A and E$133 B and C$121 B and D$150 B and E$200 C and D$174 C and E$120 D and E$199

11 Hamilton circuit (page 199). A circuit that travels or passes through each vertex of the graph once and only once. Hamilton path (page 199). A path that travels or passes through each vertex of the graph once and only once. Traveling-Salesman Problem (TSP) (page 204). A problem in which the purpose is to find an optimal Hamilton circuit - that is, a Hamilton circuit with the least total weight. Weighted graphs (page 206). A weighted graph is any graph whose edges have numbers attached to them. The numbers are called the weights of the edges.

12 Homework Read pages 196 – 211 There will be a quiz on the homework assigned Tuesday 3/27. Be sure to complete all this work and know how to answer the questions.


Download ppt "Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63."

Similar presentations


Ads by Google