关键词: 深度优先搜索, 子网络, 整体网络, 椭圆覆盖, 斯坦纳树

Abstract:

This paper establishes a proper model for solving three problems of "Optimal Park Road Design".The first problem is solved via adopting depth-first search algorithm and pruning method based on the traverse idea.The theory of "from local to the whole" is applied in the second and third problems.We divide the park road into four parts,employ the relationship between the overall network and sub-networks,and then start from the constraints which do not satisfy elliptical cover.Finally,results are checked by Steiner tree.

Key words: depth-first search;sub-networks;overall network;elliptical cover;Steiner tree