资源列表
Messiah
- 电脑鼠走迷宫的局部搜索算法，找出最短路径后返回起点开始冲刺-Computer Mouse Maze of the local search algorithm to find the shortest path back to starting point after the sprint
Huffmancode1
- 按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann
Minimum-spanning-tree
- 网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。-Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm.
MinimumSpanningTreeAlgorithm
- 最小生成树算法 c++的 希望对大家有帮助-Minimum Spanning Tree Algorithm
erchashubianli
- 实现对二叉树的各种遍历 有先序遍历 中序遍历 后序遍历 -Achieve a variety of traversing a binary tree traversal in preorder traversal sequence after traversing
mi-gong-wen-ti
- 通过队列和栈实现迷宫问题 最后走出迷宫 设置上下左右的路线 不断的进行出战和入栈 -Achieved through the queue and a stack maze of issues about the final out of the maze of setting up and down the line played and continue to conduct stack
Data_Structure
- 严蔚敏吴伟民数据结构（C语言版）源代码。 本书中每一个程序都在Borland C++ Version3.1和Microsoft VC++6.0下运行通过， BC是指Borland C++ Version3.1调试， TC是指Turbo C2.0下调试， VC是指在VC++6.0下调试。-Yan Wei-Min WU Weimin data structure (C-language version) source code. Each book in the program in
coverbycircle
- 关于覆盖问题的算法，我们用圆来实现。这里是用圆覆盖矩形的C语言程序。-using circle to cover
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 -Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given weighted graph algorithm shortest path between vertices.
linklist
- 封装了双向链表的一些操作，增加，删除，获取结点在链表中的位置，根据KEY和Name查找等-Encapsulates the two-way linked list some of the action, add, delete, access node position in the list, according to search such as KEY and Name
2
- 排序算法 数据结构中最常见的一些排序算法 像冒泡直接选择快速排序等-Sorting algorithm data structure of the most common sorting algorithm like bubble sort, etc. directly select the Quick
TEST1
- 打开一个数据文件，并排序,其实排序很简单，但是打开文件然后输出对于入门的人来说是有点难度的-It can open a file of data,then sort them.