基于最小生成树Kruskal算法的皖北地区旅游交通优化与线路组织1

mization and tour route designing. This paper aims to discuss the feasibility of tourism transportation opti-

mization and tour route designing with the Kruskal algorithm of Graph-Theory and provide some references

for the tourism planning of north Anhui province. This paper, firstly, discusses the feasibility and principles of

the Kruskal algorithm of Graph-Theory, which is used to optimize tourism transportation and design the tour

routes. Secondly, the authors choose 14 cities as major tourism destinations, including national and provincial

historic cities and cities with 3A or higher level tourist attractions as well as two important cities which are

closely neighboring with north Anhui province, then uses this theory to obtain the minimum generating tree to

connect these main tourism destinations of northern Anhui province. After modification, the optimized trans-

portation pattern is established. Next, according to the actual situation, the author designs three theme tour

routes which are natural scenery, historical and cultural landscape travel routes along Huai river, and histori-

and enhancing the marketing and strengthening the regional cooperation.

the minimum generating tree; Kruskal algorithm; northern Anhui province; transportation opti-

mization; tour route designing