伯纳德·W·泰勒-数据、模型与决策（英文版·第10版）taylor_introms10_ppt_07.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Exhibit 7.3 The Shortest Route Problem Computer Solution with Excel (2 of 4) Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall Exhibit 7.4 The Shortest Route Problem Computer Solution with Excel (3 of 4) Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall Exhibit 7.5 The Shortest Route Problem Computer Solution with Excel (4 of 4) Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall Figure 7.11 Network of Possible Cable TV Paths The Minimal Spanning Tree Problem Definition and Example Problem Data Problem: Connect all nodes in a network so that the total of the branch lengths are minimized. Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall The Minimal Spanning Tree Problem Solution Approach (1 of 6) Figure 7.12 Spanning Tree with Nodes 1 and 3 Start with any node in the network and select the closest node to join the spanning tree. Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall The Minimal Spanning Tree Problem Solution Approach (2 of 6) Figure 7.13 Spanning Tree with Nodes 1, 3, and 4 Select the closest node not presently in the spanning area. Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall The Minimal Spanning Tree Problem Solution Approach (3 of 6) Figure 7.14 Spanning Tree with Nodes 1, 2, 3, and 4 Continue to select the closest node not presently in the spanning area. Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall The Minimal Spanning Tree Problem Solution Approach (4 of 6) Figure 7.15 Spanning Tree with Nodes 1, 2, 3, 4, and 5 Copyright ? 2010 Pearson Education, Inc. Publishing as Prentice Hall Continue to select the closest node not presently in the spanning area. The Minimal Spanning Tree Problem Solution Approach (5 of 6) Figure 7.16 Spanning Tree with Nodes 1, 2, 3, 4, 5, and 7 Copyright ? 2010 Pearson Education, Inc