代价树搜索.pptVIP

3.6 代价树搜索 基本思想 代价树广度优先搜索 代价树深度优先搜索 * Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. 1) 基本思想 特点：节点间有向边的代价不同 * Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. 简化的罗马尼亚地图how many routes? Which is best?time,length,cost E.G. 1 Arad—Bucharest * Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. 2) 代价树广度优先搜索 (1）把初始节点S0放入OPEN，令g(S0)=0。 (2）检查OPEN是否为空，是，无解，退出。 (3）把OPEN第一个节点（并记该节点为n ）取出放入CLOSED。