CAJ | 학술논문

利用Dijkstra算法求连通网中某一个顶点到其他顶点的最短路径时，修改连通网的存储结构，利用邻接矩阵存储最短路径的同时引入二叉树，提高算法的执行效率．
이용Dijkstra산법구련통망중모일개정점도기타정점적최단로경시，수개련통망적존저결구，이용린접구진존저최단로경적동시인입이차수，제고산법적집행효솔．
when seeking the shortest path of one vertex to the other vertices in the communication network using Dijkstra algorithm,modifying the storage structure of the communication network,while storaging the shortest path u- sing adjacency matrix ,introdueting binary tree, which improve the efficiency of the implementation of the algorithm.