-
host2
说明： 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分：1
-
POJ2371
PKU ONLINEJUDGE 2371
- 2011-10-21 15:03:03下载
- 积分：1
-
Work3.5
上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
- 2013-12-27 21:00:03下载
- 积分：1
-
Mult
说明： 数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
- 2011-03-20 20:28:31下载
- 积分：1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分：1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分：1
-
Huffman
说明： 数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
- 2011-03-29 22:44:59下载
- 积分：1
-
KD-tree
kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
- 2013-05-10 11:03:53下载
- 积分：1
-
X_bit0mintest
X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
- 2011-07-02 21:37:01下载
- 积分：1
-
a
说明： 进程死锁.资源分配图的绘制 建立所需数据结构；
使用题目21存成的资源分配图的文件作为输入；
编写资源分配图化简算法；
每化简一步，在屏幕上显示化简的当前结果；
最后给出结论，是否死锁，如思索给出死锁的进程及资源；
(Process deadlock. Resource allocation mapping establish the required data structures Use title 21 deposit into resource allocation graph file as input writing resource allocation map simplification algorithm Each simplification step, on-screen display simplification of the current result Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
- 2013-07-04 19:50:58下载
- 积分：1
