实现 dijksta图形最短路径并且保存图形-dijksta graphics achieve the shortest path is well preserved graphics

迪克斯加（Dijkstra）算法(最短路径算法)-Dijkstra algorithm

提出一种新型的Dijkstra改进算法，具有高效性．其改进分3个方面：采用邻接表作为道路网络拓扑的存储结构；利用二叉堆实现优先队列；根据节点的分布情况将搜索过程分为几个阶段，引入了动态限制搜索区域机制．最后在实际道路网络中的测试及仿真结果表明了改进算法的可行性和优越性． -Dijkstra proposes a new improved algorithm with high efficiency. Improved three aspects: the adjacent table as th

采用prim算法和kruskal算法求最小生成树 采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other ver