资源列表
mintree
- 最小生成树，函数，画图，需要再自己编个主函数-min tree
(2)
- 关于图书馆管理系统的模糊查找，可查找书籍，书名，等-Fuzzy Lookup
libsvmtest
- libSVM簡介 這是台大林智仁老師所開發的SVM工具，應該是世界上最好用且最主流的SVM，許多國內外的研究都透過他完成的。其實SVM之所以會成為主流，是因為它的效率較高，而且結果也不錯，甚至有學者認為SVM可以取代類神經網路(林國峰等，2009)。-libSVM Introduction This is NTU prof developed SVM tool, it should be the world' s best and most mainstream use of SVM
datastructure
- C++数据结构中栈的应用 等价表达式的源代码-C++ application stack data structure equivalent expression source code
train-station--sale
- 是对火车站的售票系统的设计与实现，包括售票，退票，剩余票数等功能，对学习数据结构有很大的帮助。-The design and realization of the railway station ticket system, including ticketing, refund, the remaining votes and other functions, to learn the data structure of great help.
Dinkelbach
- 最优比率生成树,设计Dinkelbach定理，运用prim算法与迭代算法-Minimum ratio spanning tree
binary-tree
- 用C语言实现的二叉树的创建、添加节点、删除节点、递归和非递归遍历以及层次遍历-Using C language to create two fork tree, add node, delete node, recursive and non recursive traversal and hierarchical traversal
singlelist
- 单链表完备操作（创建，链表长度，节点插入，删除，定位，排序，逆序，打印等）-Single list complete operations (create, chain length, node insert, delete, positioning, sorting, in reverse order, printing, etc.)
btree
- 使用visual studio 2012在C++环境中实现B树的插入，删除等功能-Use visual studio 2012 to achieve B tree in C++ environment to insert, delete, etc.
closestpair
- 在visual C++环境中，使用分治策咯实现最邻近点对的查找，并返回最邻近点对距离的平方-In visual C++ environment using divide and conquer tactics to achieve find the nearest point, and returns the nearest point on the square of the distance
TREE
- 在visual C++环境中实现图的最小生成树的生成，并实现最小生成树的权重的计算-Heavy computing implemented in visual C++ environment, minimum spanning tree graph generation and achieve the minimum spanning tree right
sort
- 在visual C++中分别实现插入排序，快速排序，希尔排序和堆排序，通过产生随机数验证排序正确性，并计算每个算法所需的交换次数和比较次数-In visual C++, respectively, to achieve insertion sort, quick sort, Hill sort and heap sort, verify the correctness sort by generating a random number, and each algorithm to calcul