搜索资源列表
ch06
- 我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discu
ch07
- 二元搜尋樹簡單易懂，不過有一個問題：它並非平衡樹。本章將介紹平衡的 AVL 搜尋樹，討論它的資料結構、函式，並設計程式使用它。 -Simple binary search tree, but there is a problem: it is not a balanced tree. This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and
ch08
- 堆積（heap）是樹結構的第三種型態。堆積是一棵二元樹，其左右子樹節點的值均較其父母節點的值小。堆積的根節點值保證是該樹最大值。這中堆績稱為最大堆績。堆積的子樹可擺在左邊當左子樹，也可擺在右邊當右子樹，因此左右子樹俱有相同的性質。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
WirelessMultimedia
- 流媒体 无线多媒体 会议论文 清华大学课程指定阅读文献 英文-Multicast in 802.11 WLANs_An Experimental Study.pdf Multiple Tree Video Multicast over Wireless Ad Hoc Networks.pdf Optimized Multi-Path Routing Using Dual Decomposition for Wireless Video Streaming.pdf System Des
binarytreealgorithm
- 一个排序二叉树算法的基本实现，C++初学者可以学习一下-Sort of a basic binary tree algorithm implementation, C++ beginners can learn about
DOS2222222222222222
- DOS也许已经是历史了 但是电脑高手不能不去了解一点DOS操作, ^_^,查IP,建立目录树-DOS may have is the history of the computer expert but do not understand that the DOS can not do so,check IP, set up the directory tree, etc.
Snort
- 分析了数据包调用检测函数匹配规则节点的平均次数计算函数，并用该函数对Snort系统规则树进行了优化，减少了数据包过滤匹配次数，极大提高了入侵检测效率-Analysis of packet matching rules called detection function of the average number of nodes the calculation function, and the system function of the Snort rules tree is optimiz
BSTREEE
- binary search tree is umplemented using data structures in C-binary search tree is umplemented using data structures in C++
KONGQING
- 编译原理LR(0)文法分析器 录入合法的LR(0)文法，将输出LR(0)分析表，并可以对输入的句子进行语法分析输出相应语法树。程序中部分算法还很不简洁，有待改进，欢迎朋友与我多多交流。--compiler theory LR (0) grammar analyzer input legitimate LR (0) grammar, will output LR (0) analysis table, and may import for the sentence syntax analysis
shujujiegou
- 实现对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s
000
- 赫夫曼树的建造。。。。。。。。。赫夫曼编码。 -Huffman tree construction. . . . . . . . . Huffman coding.
FPGA
- 基于FPGA数字乘法器的设计：数字乘法嚣是目前数字信号处理中运用最广泛的执行部件之一，本文设计了三种基于FPGA 的数字乘法器．分别是移位相加乘法嚣、加法器树乘法器和移位相加一加法嚣树混合乘法器。通过对三种方案的仿真综合以厦速度和面积的比较指出了混合乘法器是其中最佳的设计方案-FPGA-based digital multiplier design: the number of multiplicative noise is the use of digital signal processin
B5B8E35Bd01
- Web access path prediction using knowledge discovered from web logs has become an active research area. Web logs provide updated information about the user’s access record to a web site, which contains useful patterns waiting to be discovered and use
01278331
- Wavelet Tree Quantization for Copyright Protection Watermarking
GetMacAddr
- 经典的树形文件目录 经典的树形文件目录 经典的树形文件目录-Classic classic tree file directory tree file directory tree file directory classic classic classic tree file directory tree file directory
Binary_Trees
- 二叉树数据结构的讲义，全面介绍了完全二叉树、满二叉树的概念-Binary tree data structure of the lecture notes, a comprehensive descr iption of the complete binary tree, full binary tree concept
Program
- build binary tree in visual c-build binary tree in visual c++
Tree_Method
- power tracing using tree method
2
- 构造霍夫曼树，该压缩包包含该算法的源代码。。 是本人的实验代码，原创来的-Huffman tree construction, the compressed packet contains the source code of the algorithm. . Is my experimental code, original come. . .
prim
- Prim’s Minimum Spanning Tree Algorithm