xianduan

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)

图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)

数据结构课程作业，查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)

说明：  ACM及各类基本算法模板，包括数据结构，计算几何，字符串，图论，数学，高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)

NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )

说明：   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

这个是C++编译的单链表，其中包括多种链表操作，是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)