资源列表
C
- C语言描述的常用算法 很有用的 希望有帮助-C language to describe the commonly used algorithms useful want to help
huffman_3
- 功能包括从文件中读取文章,将文章转换为哈夫曼编码,将哈夫曼编码还原,就是那几个基本算法的实现啦。 为了方便查看,这里输出的哈夫曼编码是1byte的,其实真正应该将其变为1bit存储,这样才能达到压缩的目的。-Features include articles to read from the file, the article is converted to Huffman coding, Huffman coding will be restored and that is the rea
pi_1
- 一个求pi的很巧妙的经典算法 我对对其中的想法深感震惊 所以拿来给朋友们分享-Pi seeking a classical algorithm very clever of them I am deeply shocked by the idea of it were given to friends to share
gongertidufa
- 运用共轭梯度法来给函数求极值的c++程序-The use of conjugate gradient method to seek extreme value to the function of the c++ program
sanchazhi
- 运用三插值法给函数求极值的c++的源代码-Using three interpolation to the function extremum seeking the source code c++
graphic
- 本压缩文件为完整的二分图最优匹配的KM算法程序和求有向图的欧拉回路的算法程序-KM algorithm and Euler circuit of Digraph
Optimum-ratio-spanning-tree
- 本压缩程序为最优比例生成树算法的实现程序,代码完整。-The compression program is the realization of the optimal ratio of Spanning Tree Algorithm, code integrity.
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法,代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序,代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
zuiniudeNhuanghousuanfa
- 用位操作实现的求解N皇后问题,算法效率很高-Using bit operations to achieve the solution of N Queens problem, the algorithm very efficient
VB-ReversePoland
- 自己用VB写的逆波兰表达式算法,包括中缀表达式转换到后缀表达式,后缀表达式的计算,在模块reversePoland.bas中,都已经写成了函数。-This code source written with visual basic is a realization of reversepoland algorithm.The transformation to suffix expression is expected in the file reversePoland.bas. In addt
PDC
- Apply Ben-Israel and Iyigun s Probabilistic D-Clustering (PDC) algorithm for clustering. This implementation is based on: Adi Ben-Israel and Cem Iyigun, "Probabilistic D-Clustering", Journal of Classification 25:5-26 (2008)
