Algorithms And Procedures Of Determining The Optimal Route In The Graph
Algirdas Sokas · 2013
This article analyzes algorithms and procedures of determining the optimal route in the graph. The model of the problem is presented as non-directional graph, where nodes are towns and edges are roads among towns. All towns are connected by roads. These roads are shown as graph edges. Nearest neighbor algorithm is selected for route optimization. Algorithms and procedures to exercise solution are presented. The program is written in Visual Basic for Application language working in the graphical system AutoCAD environment. Graphical system for selected towns on Lithuanian map finds optimal route. A solution is presented in graphical form with total length of the route. Obtained results are discussed and conclusions are made.