-
04huffman_a
根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
- 2007-05-29 19:15:26下载
- 积分:1
-
Campus-navigation-problem
校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。
要求:
(1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。
(2)为来访客人提供图中任意景点相关信息的查询。
(3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。
(4)修改景点信息。
(Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path).
Requirements:
(1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information.
(2) the figure for visiting any sites offering information about the query.
(3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites.
(4) modify the attractions information.)
- 2011-08-12 10:34:14下载
- 积分:1
-
migong
迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分:1
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分:1
-
12
说明: 哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
- 2011-05-06 14:42:14下载
- 积分:1
-
jose
约瑟夫环(约瑟夫问题)是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1,最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分:1
-
stack
数据结构 堆栈 实现了以下功能:
cout<<"----------------主菜单---------------"<<endl
<<"* 1.建立 *"<<endl
<<"* 2.输出 *"<<endl
<<"* 3.判断栈是否为空 *"<<endl
<<"* 4.栈的长度 *"<<endl
<<"* 5.输出栈顶元素 *"<<endl
<<"* 6.进栈 *"<<endl
<<"* 7.出栈 *"<<endl
<<"* 8.遍历 *"<<endl
<<"* 9.数制转换 *"<<endl
<<"* 10.清空 *"<<endl
<<"* 11.销毁 *"<<endl
<<"* 12.退出 *"<<endl
<<"--------------------------------------"<<endl<<endl (data structure stack)
- 2013-11-01 11:05:10下载
- 积分:1
-
prim
普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
- 2012-05-17 09:11:15下载
- 积分:1
-
LinearList
单链表程序 可执行单链表的基本功能 创建 删除 查找 存取 等等(Basic functions to create a single linked list program executable single linked list delete find access)
- 2012-10-31 17:15:54下载
- 积分:1
-
string.tar
数据结构课程设计--实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
- 2009-11-08 12:20:02下载
- 积分:1