二叉树在Dijkstra算法最短路径存储中的应用

The application of Binary Tree in Storage of the Shortest Path Realized by Dijkstra Algorithm

利用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.