资源列表
BinaryTree-(1)
- Binary tree source codes
sequenlist
- 用C++编写的，数据结构顺序表九个功能的实现！- Compiles with C++, construction of data sequence chart nine function realizations!
Lab-Sharp-4
- A full adder with non-uniform csa
ShortestPath
- 云风的求解最短路径代码,旨在用易于理解和简洁的代码描述出 A* 算法在求最段路 * 径中的运用.-Solving the shortest path of cloud wind code, to use the code easy to understand and concise descr iption of the A* algorithm to find the section of Road* Trail of use.
selection
- 选择排序算法的升序表示，同时也是用一元数组实现的。-Select ascending sort algorithm that is also implemented with an array of one dollar.
c
- 精细介绍了c#算法和技术的应用，是很好的一个学习c#的资料，讲解的很详细-Fine introduced the c# algorithm and technology, is a learning c# very good information, to explain in great detail
Joseph
- 约瑟夫环而且有密码设置的,可以依次输出出局的人的号码及他的密码-Joseph program，which has the password setting .
HuffmanTree
- 霍夫曼编码程序，根据各个节点的权值，给出对应的霍夫曼编码值。-Huffman coding procedure, according to the weight of each node is given the value of the corresponding Huffman.
tree
- 数据结构，堆栈操作，二叉树建立、遍历操作，哈夫曼树输入、编码译码-Data structures, stack operations, build a binary tree, traversal, Huffman tree input, coding and decoding
k-way
- K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single source shortest path problem, but
zheban
- 折半算法在labview中的实现，折半算法能节省算法的时间复杂度。-Labview in the binary algorithm in the realization of a binary algorithm can save the time complexity of the algorithm.
IntelligentGrid
- 智能网格系统结构体系研究 一篇探讨性的论文，希望对大家有帮助-Intelligent Grid