-
哈夫曼编码
程序是要建立一个哈弗曼树，并利用哈夫曼树求相应编码和译码，根据输入的一串电文（字符串）来设计哈夫曼树，并根据哈弗曼树求出每个字符相应的编码，最后根据已知的编码，随机组合输入编码串，根据哈弗曼编码和哈弗曼树求出译码内容。
主要输入形式为一串字符串例如：abcd
输入的范围就是这26个字母，不限大小写，定义最多输入的字符不超过100个。
输出的形式根据要求，输入字符串后，要输出每个字符及其权值（出现次数）；
然后再输入要译码的编码串，输出译码内容。
- 2022-03-16 10:05:21下载
- 积分：1
-
数据结构：表达式计算
c语言用堆栈实现表达式计算，数据结构练习题。
- 2022-02-15 15:07:56下载
- 积分：1
-
small-True
最小生成树C语言代码 最小生成树C语言代码(small tree small tree small tree)
- 2012-11-24 22:55:00下载
- 积分：1
-
BiTree
二叉排序树的建立、插入与删除。按递增顺序插入N个整数，并按同样顺序删除；(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )
- 2020-09-05 16:38:05下载
- 积分：1
-
Figure-topological-sort
说明： 拓扑排序
对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任
意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。
通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。
注意：
①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。
②若图中存在有向环，则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分：1
-
test12
约瑟夫问题，用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems，30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )
- 2012-05-14 10:29:52下载
- 积分：1
-
KDTreeTest
一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)
- 2020-12-22 10:29:08下载
- 积分：1
-
ASDESGTree-Search
论文 <A Study of Decision Error in Selective Game Tree Search>(paper <A Study of Decision Error in Selective Game Tree Search>)
- 2011-04-26 23:10:26下载
- 积分：1
-
binary-search
此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists
)
- 2011-07-06 15:50:17下载
- 积分：1
-
作业7
一．问题描述
设计、实现一个全国大城市间的交通咨询程序，为旅客提供三种最优决策方案：（1）飞行时间最短（2）总用时最短（3）费用最小（4）中转次数最少。
二、实验要求
（1）选取合适的数据结构存储带权路线图
（2）实现单源最短路径算法(1. Description of the problem
To design and implement a transportation consultation process between the major cities, we provide three optimal decision strategies for passengers: (1) the shortest flight time (2), the shortest total time (3), the minimum cost (4), and the least number of transfers.
Two. Experimental requirements
(1) select the appropriate data structure storage band weight Roadmap
(2) realization of the shortest path algorithm for single source)
- 2020-12-25 19:59:05下载
- 积分：1
