搜索资源列表
pudn
- 给定权值、叶子和结点的个数进行Huffman信源编码-Given the right value, leaves and the number of nodes for Huffman source coding
HOFFMAN
- 根据给出的结点权值生成huffman 树并输出hoffman编码的简单c语言程序-creat hoffman tree of input node with given weights and output the code of the nodes
huo
- 可以进行霍夫曼编码，输入结点数和权值进行编码-Huffman code can be input nodes and the right to encode values
huffman
- 构造一颗霍夫曼树,输入叶子节点的字符及权重，输出字符对应的Huffman编码，还可以通过输入0.1编码翻译出对应的字符-Hoffman Construction of a tree, enter the leaf nodes and the weights of the characters, the output of the Huffman code corresponding characters can be translated by entering the correspondin
nodes
- its a aodv tcl file scr ipt ...it is for NS2 simulation-its a aodv tcl file scr ipt ...it is for NS2 simulation.....
PQpowerflow
- matlab编写的潮流程序，内附30个节点的验证-matlab program written in the tide, containing 30 nodes verify
Clustering
- Clustering algorithm to cluster different nodes in graph.
leachRouting.tar
- we have discussed HCTA based tracking and single hop routing and LEACH based tracking and clustering routing. LEACH based tracking is divides sensor nodes in cluster. In each cluster CH (cluster head) applies aggregation process on packets then d
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
Huffman-algorithm-code
- 哈夫曼树是一种树形结构，用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物，而是一种数据结构，因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的，此树的特点就是引出的路程最短。 概念理解：1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to sol