-
FRFT-algorim
常在该网站下载资料,也想分享些材料上去,这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)
- 2020-07-04 13:00:02下载
- 积分:1
-
bfs
这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
- 2013-12-05 15:56:50下载
- 积分:1
-
nuaa1507_DancingLink_trackback.cpp
高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
- 2010-03-07 10:54:32下载
- 积分:1
-
american_heritage
USACO中的American heritage,用C++编写,运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)
- 2013-07-21 18:31:10下载
- 积分:1
-
Euler-algorithm
这是一个实现找出欧拉路径的的算法,比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)
- 2014-07-13 15:20:12下载
- 积分:1
-
Project_ShortestPath
任务:实现Dijkstra算法
工程名:Project_ShortestPath
要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。
(Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
- 2013-08-21 16:40:41下载
- 积分:1
-
03
说明: 《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
- 2011-04-24 01:36:18下载
- 积分:1
-
Hash-table
哈希表
数据结构课程设计
1.1问题描述
针对自己的班集体中的“人名”设计一个哈希表,使得平均查找长度不超过R,完成相应的建表和查表程序。
1.2基本要求
假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个,取平均查找长度的上限为2。构造哈希函数,用链表法处理冲突。
1.3测试数据
读取熟悉的30个人的姓名作测试。(Hash table
Data Structure Course Design
1.1 Description of the problem
For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures.
1.2 Basic requirements
Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict.
1.3 Test Data
Read the familiar names of 30 individuals tested.)
- 2011-12-19 15:39:00下载
- 积分:1
-
huffman
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分:1
-
huffman_tree_code
Huffman编码与译码,实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)
- 2007-04-17 19:22:39下载
- 积分:1