TREE
共 348 篇文章
TREE 相关的电子技术资料，包括技术文档、应用笔记、电路设计、代码示例等，共 348 篇文章，持续更新中。
The emphasis of this book is on real-time application of Synopsys tools, used to combat various pro
The emphasis of this book is on real-time application of Synopsys tools, used
to combat various problems seen at VDSM geometries. Readers will be
exposed to an effective design methodology for handl
此文档是用vistual studio 2005 开发的用来描述3D-tree 的生长过程
此文档是用vistual studio 2005 开发的用来描述3D-tree 的生长过程
a paper titled A Novel tree based broadcast algorithm
a paper titled A Novel tree based broadcast algorithm
Binary_tree.cpp ：执行文件生成所有二叉树 这样做的目的C + +程序是产生所有二叉树指定节点数目。 基本思想是衍生所有二叉树基于退化树。 该算法的动机是圆括号法则代表二叉
Binary_tree.cpp ：执行文件生成所有二叉树
这样做的目的C + +程序是产生所有二叉树指定节点数目。
基本思想是衍生所有二叉树基于退化树。
该算法的动机是圆括号法则代表二叉树。
一组括号可通过字典秩序排列，由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置（在这里，我们假设右向是正确的退化树方向） 。
该文
Implements Minimum Search Tree using Kruskal Algorithm
Implements Minimum Search Tree using Kruskal Algorithm
叉查找树示例|二叉查找树,binary search tree,C语言
叉查找树示例|二叉查找树,binary search tree,C语言
) Compression using huffman code -with a number of bits k per code word -provide huffma
) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability di
this book mainly includes these contents :linked list, stacks and queuse, recursions, binary tree, m
this book mainly includes these contents :linked list, stacks and queuse, recursions, binary tree, multi tree, graphs, sorting, hashing, data compression.
red black tree red black tree
red black tree red black tree
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely ba
Heapsort
1.A heap is a binary tree satisfying the followingconditions:
-This tree is completely balanced.
-If the height of this binary tree is h, then leaves can be at level h or level h-1.
-All
Article:Reconstructing 3D Tree Models from Instrumented Photographs
Article:Reconstructing 3D
Tree Models from
Instrumented
Photographs
steiner tree工具
steiner tree工具，利用率挺高的，计算minial steiner tree时候可以看看
b+ tree code implementation and insertion deletion
b+ tree code implementation and insertion deletion
all traversals in binary search tree with simple coding..
all traversals in binary search tree with simple coding..
ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分
ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分，主要包括不同网络拓扑结构下ZigBee协议数据单元的路由方式、路由发现和路由维护等内容。为了达到低成本、低功耗、可靠性高等设计目标，ZigBee网络采用了Cluster-Tree与AODV路由相结合的路由算法。该包实现了ZIGBEE路由算法在NS2下的模拟
樣板 B 樹 ( B - tree ) 規則 : (1) 每個節點內元素個數在 [MIN,2*MIN] 之間, 但根節點元素個數為 [1,2*MIN] (2) 節點內元素由小排到大, 元素不
樣板 B 樹 ( B - tree )
規則 :
(1) 每個節點內元素個數在 [MIN,2*MIN] 之間, 但根節點元素個數為 [1,2*MIN]
(2) 節點內元素由小排到大, 元素不重複
(3) 每個節點內的指標個數為元素個數加一
(4) 第 i 個指標所指向的子節點內的所有元素值皆小於父節點的第 i 個元素
(5) B 樹內的所有末端節點深度一樣
dhtmlx媲美EasyUI的好用UI组件
<span style="white-space:normal;">dhtmlx标准版源码，包含tree、form、grid等常用插件</span>
ooptimal binary search tree algorithm using dynamic approach
ooptimal binary search tree algorithm using dynamic approach
伸展树
伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
A simple decision tree c++ implementation
A simple decision tree c++ implementation