asian

骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128

Matlab入门篇介绍了一些基本的Matlab语句。并且有丰富的实例。-chapter introduces some basic Matlab statement. And there are abundant examples.

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

这个程序用于实现哈希表，在初始化时赋予哈希表20个数值，然后点击查看当前哈希表，完成后点击重建哈希表-This process used to implement hash table, given in the initialization hash table 20 values, and then Click to view the current hash table, click on the reconstruction after the completion of hash table

这是一个学生成绩的记录表练习，是数据结构中的链表实现的，对初学者有很大帮助，自己写的，多有不足，请大家一起完善。

SD卡读卡器阿杜伊诺.qwewqewq eewq wq ew ewwq eqw eqwe wqe wqe wq ewqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe wqe

用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

按照前序非递归遍历二叉树，递归法将二叉树的左右子树互换-In accordance with the pre-order traversal non-recursive binary tree, binary tree recursive method will swap the left and right subtree

车辆管理-vehicle management