Interest Tourism Route Plan Algorithm Based on Improved Minimum Spanning Tree

Abstract

Currently, tourism route plan lacks of individuality, which can hardly meet the needs of tourists’ motive benefits. Aim at the problem, this paper brings forward interest tourism route plan algorithm based on improved minimum spanning tree. Firstly, tourism interest feature model is set up. Based on each influence factor, iteration values on minimum spanning trees of different start sight spots are obtained. Select the spanning tree and route with maximum value as the optimal spanning tree and route. This algorithm can get the optimal tourism route to meet the best motive benefits for tourists, which is feasible and practical.