搜索结果

PIC单片机模拟串口 11.0592时钟 支持2400波特及以下稳定收发 一位起始，八位或九位数据，无校验，一位停止位 占用时钟1，和RB端口电平变化中断 HI-PICC编译平台 模拟收发管脚在m_usart.h中定义 PIC16F877A最小系统验证可用

专家点评: Y P7 `. @ {$ r％ pa.功能很强大，可以看出花了很多心血在算法上，非常好。算法上还有一点瑕疵，例如在删除一个员工的同时没有办法自动建立其他员工的上下级关系，必须删除全部下级员工，不是非常合理。此外，界面设计过于简单，应该加强. " W" R+ b* g$ a$ Sb.程序运用了自己的算法来提高Tree控件显示的速度和 ...

The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a ...

Huffman codes &#1048708 In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? &#1048708 To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. &#1048708 This problem c ...

读取XML信息，显示在tree上。并且提供各种控制功能

This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental m ...

spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries

自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。

一个简单的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后台的交互

伸展树，基本数据结构，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.