资源列表
MyProjects
- 这是一篇关于图的建立的应用数据结构的一点点程序，你懂的-Figure can be build.You can see it how to build!At the same time ,,it is a simple way to buuild a figure!
LABYRINT
- 基于prolo语言编写的高级小型迷宫问题求解程序（即找出最短路径）-A little program which is main to solve the labyrinth problem！
Ackerman
- ackerman 函数的实现 数据结构与算法-ackerman function implementation
kmp
- kmp算法的实现 字符匹配 next值计算-kmp algorithm for data structure and algorithm
trackBoundary
- snake算法的vc实现代码，包括特征点检测以及边缘分割部分-vc snake algorithm implementation code, including the feature point detection and edge segmentation part of the
2
- 已有a、b亮光链表，每个链表中的结点包括学好、成绩。要求把两个链表合并，按学号升序排列。 -Have a, b light list, each node in the list, including learn, results. Required to merge the two lists, in ascending order by student number.
4
- 10有两个链表a和b,设结点中包含学号、姓名。从1链表中删去与b链表中有相同学号的那些结点。-10 There are two lists a and b, set node contains student number, name. Deleted from a list and b have the same student number in the list of those nodes.
5
- 建立一个链表，每个结点包括：学号、姓名、性别、年龄。输入一个年龄，如果链表中的结点所包含的年龄等于此年龄，则将此结点删去。 -The establishment of a linked list, each node including: student number, name, gender, age. Enter an age, if the list contains the node age, this age, this node is deleted.
fenzhixianjiefa
- 分支限界法常以广度优先或以最小耗费（最大效益）优先的方式搜索问题的解空间树。-Branch and bound often breadth-first or least-cost (most effective) way of priority the solution space tree search problems.
shujujiegou
- 数据结构的各个算法 树，图，哈希表等十多个算法源代码，ACM 专用-Tree data structure of each algorithm, graphs, hash tables and a dozen algorithm source code, ACM Special
hash
- 采用六种数据结构（数组、链表、STL、箱、二分查找树、位向量），实现统计存储若干个随机数所需要的时间。-Using six data structures (arrays, lists, STL, containers, binary search tree, bit vector), to achieve a number of statistical random number stored in the time required.
bianli
- 本程序用c语言编写，是实现数的遍历。 可参考使用、学习-This procedure with c language, is to achieve the number of traversal. Can be used for reference, study