资源列表
match(man&women)
- 回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
bf_algorithm
- 字符串匹配算法-BF算法，它是字符串匹配的最简单算法，适合入门时参考。
Quick_Sort220762752011
- To understand a Basic data structural term in C named "Quick Sort".
200911221
- 停车场问题,利用栈模拟停车场，实现汽车的停入退出及收费问题-parking area
link
- 实现双向链表的一个类，有简单的前移后移删除添加操作-A doubly linked list class, add simple forward, backward delete operation
0518
- 这是一个实现数据结构中求解强连通子图的小程序，是实验课的产物，希望对学生朋友有帮助。-This is a data structure for solving strongly connected subgraph of small procedures, the product of the experimental class, the students want to help friends.
1
- 随机建立一个含N个整数的整数数组（输出），再按奇偶数分存于两个不同的线性表（顺序和链接）中并别输出上述两个表。-Random array of integers containing N integers (output), and then the parity number are stored in two different linear table (order and links) and do not output the two tables.
tu
- 数据结构,哈工大数据结构第三次实验,图求最小单元路径。-Data structure HIT data structure of the third experiment, Figure Find the smallest unit path .
T006_Floyd_Warshal
- T006_Floyd_Warshall算法任意两点间的最短路径-T006_Floyd_Warshall algorithm shortest path between any two
linjiebiaoshortpath
- 用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序-adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures
huffman.rar
- 给定n个权值作为n个叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。,Given n weights as a the n leaf node, construct a binary tree, with the right path length to a minimum, said such a binary tree for the optimal binary tree, also known as Huffman
sxdicss
- Inclan和Tiao(1994) 提出的迭代累积平方和算法（ICSS）是对变点检验的一种比较成熟方法。该算法假定时间序列在开始一段时间内呈现出平稳性方差，直到方差发生突变才会改变其波动水平，随后又保持一个方差直到下一个突变反复重复上述过程，就能得到未知数目的方差突变时间。-break point