搜索资源列表
shorttest_path
- 在一个有向图中寻找利用迪杰特斯拉算法拉寻找从一个点另外任意一个点的最短路
shool_wizard
- 自己做的校园导航图，大二有关迪杰斯特拉算法的实验，包括界面-Do their own campus navigation map, the Dijkstra algorithm sophomore experiments, including the interface
zdlj
- 图的迪杰斯特拉算法，本人亲自将课本的代码打出来并进行了修改-Graph Dijkstra algorithm, I personally would play out and the code books were modified
homework5
- 实现迪杰斯特拉最短路径算法，校园导航图，校园个地点的搜索-Dijkstra shortest path algorithm to achieve the campus Map
Dijkstra[VCPP]
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for calculating a node to all other nodes in the shortest path.
dijkstra
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。-Dijkstra algorithm is a Dutch computer scientist Dijkstra proposed in 1959, so called Dijkstra algorithm. The rest is one vertex to each vertex of the shortest path alg
map
- VC6.0写的以迪杰斯特拉算法为原理的地图程序。以MFC为基础实现了图形化的显示。-VC6.0 write to Dijkstra algorithm principle mapping application. In MFC-based realization of a graphical display.