Finding the optimal route for tourism using Dickstra's algorithm

Tourism industry like other industries must apply the last and modern information and communication technology to develop. However, travel costs is one of the most important issues in this regards particularly when tour operators aim to planning towards determining tourism route. If we determine places visited by tourists as points on the map and draw communicational rout between these points, a set of points and routs in a graph can be showed. Each point indicates target point and each graphite edge indicates the rout between two points. Each graphite edge has a weight indicating cost, time or other travel indicators. Here, the issue is finding shortest, low cost or nearest routs between one point and other points. Therefore, this study aims to find this rout by using Dickstre's algorithm. This algorithm can be applied in software program related to services in tourism field towards planning tours.