摘要
通过理论分析,结合实际应用,在GIS节点数很大的数字地形图中,从完备性、最优性、时间复杂度、空间复杂度几种性能问题实例分析,较系统地总结出深度优先搜索(DFS)、广度优先搜索(BFS)、双向广度优先搜索(DBFS)、A★算法四种算法代价及优缺点.
Throughout theoretical analysis,connected with practical application,we compared these performance problem such ascategoricalness,optimality,time complexity,space complexity in GIS(Geographic Information Systems) digital relief map which have many nodes.Then sum up systemicly the algorithm cost and The superiorities and deficiencies of Depth First Search(DFS),Breadth First Search(BFS),Double Breadth First Search(DBFS),A-star.
出处
《电脑知识与技术（过刊）》
2007年第16期1030-1032,共3页
Computer Knowledge and Technology
