-
linked
关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
- 2013-02-03 11:10:07下载
- 积分：1
-
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
- 2013-11-28 10:53:29下载
- 积分：1
-
m-in
说明： 数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)
- 2008-09-25 08:06:33下载
- 积分：1
-
12
说明： c编写的链表连接函数，上课时学的，上传试试 (c write the list to connect function, class, learn, try uploading)
- 2010-07-08 15:27:22下载
- 积分：1
-
HuffanCoding
读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。
读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。
将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。
将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。
根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。
根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。
写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。
(Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file.
Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array.
The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter.
The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself.
According to Huffman coding. The formation of the target file Huffman coding, this code returns.
According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
- 2020-07-02 15:40:01下载
- 积分：1
-
suanfa
匈牙利算法以及指派问题介绍，kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
- 2011-09-10 09:42:39下载
- 积分：1
-
dijkstra
dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
- 2007-07-15 14:14:48下载
- 积分：1
-
BinaryTree
二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
- 2012-12-28 10:40:23下载
- 积分：1
-
SplitADT
链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数
(Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
- 2007-03-30 20:48:18下载
- 积分：1
-
Prim
编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分：1
