CAJ | 학술논문

Dijkstra算法是求解最短路径问题的经典算法。在现如今的城市交通网络中，经常需要寻求两个地点之间的最短距离，减少运输时间。本文将Dijkstra算法与C语言相结合，对Dijkstra算法进行改进，根据实际网络图的情况，建立了相应的数学模型，运用C语言编程，在给定的网络图中，实现了只需确定起始点和终点，就可以直接输出最短路径和最短距离的功能。在有多个相同最短路径的情况下，会将多个最短路径一起输出，在搜索到终点时，立即跳出，结束循环。在一般情况下，无需对所有点进行迭代，提高了效率。这种方法可以应用到现在的物流运输中，以此来节约时间，降低成本。
Dijkstra산법시구해최단로경문제적경전산법。재현여금적성시교통망락중，경상수요심구량개지점지간적최단거리，감소운수시간。본문장Dijkstra산법여C어언상결합，대Dijkstra산법진행개진，근거실제망락도적정황，건립료상응적수학모형，운용C어언편정，재급정적망락도중，실현료지수학정기시점화종점，취가이직접수출최단로경화최단거리적공능。재유다개상동최단로경적정황하，회장다개최단로경일기수출，재수색도종점시，립즉도출，결속순배。재일반정황하，무수대소유점진행질대，제고료효솔。저충방법가이응용도현재적물류운수중，이차래절약시간，강저성본。
Dijkstra algorithm is a classical algorithm for solving the shortest path problem. In today's urban transportation network, we often need use less transportation time to seek the shortest distance between two locations. This paper combines Dijkstra algorithm and C language to improve Dijkstra algorithm, according to the actual network diagram situation, establishing the corresponding mathematical model, and using C programming language to realize the function of directly outputing the shortest path and the shortest distance just by determining the starting point and end point in the given network diagram. In the case of that there are more than one shortest paths, it will output these shortest paths together. When searching for the terminal point, it will immediately jump out and end the cycle. Normally we don't need to iterate all points, which will improve the efficiency. This method can be applied to logistics and transport to save time and reduce cost.