This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Chapter 12 Self Test pg 530 1. Which technique is used to connect all points of a network together while minimizing the distance between them? c. minimal-spanning tree technique 2. The first step of the minimal-spanning tree technique is to: e. select any node 3. The first step of the maximal-flow technique is to: b. pick any path from the start to the finish with some flow. 4. In which technique do you connect the nearest node to the existing solution that is not currently connected? c. minimal-spanning tree 5. In the shortest-route technique, the objective is to determine the route from an origin to a destination that passes through the fewest number of other nodes. b. False 6. Adjusting the flow capacity numbers on a path is an important step in which technique? a. maximal flow 7. When the optimal solution has been reached with the maximal-flow technique, every node will be connected with at least one other node. b. False 8. A large city is planning for delays during rush hour when roads are closed for maintenance. On a normal weekday, 160,000 vehicles travel on a freeway from downtown to a point 15 miles to the west. Which of the techniques discussed in this chapter would help the city planners determine if alternate routes provide sufficient capacity for all the traffic?...
View Full Document
- Spring '09
- Graph Theory, Shortest path problem, Flow network, Spanning tree, minimal-spanning tree technique