Algorithm on extending question of optimum circuit route
FU Cheng-qun, Pla Uni · Journal of PLA University of Science and Technology · 2006
In order to find a simple and efficient way to resolve the question of optimum circuit route,under two basic assumptions,firstly the Dijkstra algorithm was applied to working out the cost of the shortest travel between tops in part and distance matrix of graph with arrow between nodes was obtained;and then on the whole the Hungary method was made use of to obtain the overall optimum circuit route,and the question of part circuit was discussed.Finally,an algorithm named four-phase on extending question of optimum circuit route was founded,which was unlimited by the number of nodes.And calculating results show that the algorithm is reliable through examples.