资源列表
maze-mfc
- 界面好看的迷宫程序，用MFC实现，用户可以自己建造迷宫，可以随时修改迷宫地图，编理有具体的路线显示。-Interface nice maze procedure, using MFC, users can build their own labyrinth, you can always modify the maze map, the compilation of a specific route display.
Maze
- 根据数据结构里的不相交集写的，并根据他的要求分别拆墙完成的 程序名称:迷宫的随机生成与迷宫路径查找 程序原理:不相交集的简单应用 功能介绍:根据不相交集原理随机生成迷宫并查找其路径,输出迷宫的数字及图文信息及带路径的图文信息(含文件操作) -Written according to the disjoint set data structure, and tearing down walls to complete his request Program Name
C-tuopu
- 该文件能实现拓扑排序算法， 一链表为数据存储的容器-The file to the topological sorting algorithm, a linked list for data storage container
A^B
- 该文件能计算a的b次方对9907取模的值-The file is able to calculate a b-th 9907 modulo value
T7_42zipo
- 以邻接表为存储结构实现求从源点到其余各顶点的最短路径的Diijkstra算法-Dijkstra，已通过测试。 -Adjacency list, ask the rest of the vertices of the shortest path from source to the storage structure Diijkstra algorithm-Dijkstra, has been tested.
Dlabyrintthi
- 利用不相交类集制作的自动生成成迷宫的程序,迷宫大小可自由改变 -Disjoint set of classes produced automatically generated into the maze procedure, the maze size can be free to change
Msearchha
- 迷宫搜索 ，A*算法 ，自动生成成迷宫矩阵，查找最短路径可直接使用。 -Maze search, A* algorithm, and automatically generated into a maze matrix, find the shortest path can be used directly.
stack-data-structure
- 数据结构中堆栈的演示 非常详细和简单 可以供大家参考下-Demonstration stack data structure for your reference
CPP
- 教程 可以看着里面的PPT自学c语言，省去了去查阅书籍的麻烦-The tutorial can look inside the PPT self-c language, eliminating the trouble of access to books
DDDijkstrai
- Dijkstra算法，解决最短短路径问题，由文本文件输入路的长短 -Dijkstra algorithm to solve the most short path problem, the length of the road from the text file input
Lhheap_dji
- 使用堆+链表实现dijksttra,求单源最短路可直接使用。 -The heap+ linked list dijksttra seeking single-source shortest path can be used directly.
TDIJKSTRAAsh
- 这是一个求最短路的算法，用DIIJKSTRA的方法可直接使用。 -This is a request to the shortest path algorithm, DIIJKSTRA the method can be used directly.