搜索资源列表
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
Dijkstra
- 用Dijkstra算法实现最短路径，在VC++6.0中运行-Using Dijkstra shortest path algorithm in VC++6.0 run
grap
- 在矩阵储存结构下,求图的最短路径,在VC++6.0上运行正常-Stored in the matrix structure, and the shortest path map in VC++6.0 run on normal
maze2
- 在VC中找出迷宫的最短路径，并在MFC中画出-In the VC in the maze to find the shortest path, and the MFC in the drawmigong
mapxPvc-shortest-path
- 在给定地图中寻找两点最短路径，在VC++环境编译通过！-Given map to find the shortest path in VC++ and compiled by
floyd1
- 在VC++的环境中使用floyd算法寻找网的最短的路径，并最后输出最短路径-Floyd algorithm to find the shortest path of the network, and the final output shortest path used in the environment of VC++
floyd2
- 在VC++的环境中使用floyd算法寻找网的最短的路径，并最后输出最短路径-Floyd algorithm to find the shortest path of the network, and the final output shortest path used in the environment of VC++
Graph
- VC++编写的数据结构图算法演示系统，可作毕业设计系统，包含深、广度遍历，最小生成树，拓扑排序，最短路径算法。-Graph algorithm operating system,include depth/breath first search,minitree,topsort,shortestpath.
shortest
- 使用迪杰斯特拉求最短路径算法。用到了VC++6.0开发工具-Use Dijkstra shortest path algorithm. Used the VC++ 6.0 development tools