This is an implementation of double-array structure for representing trie, as proposed by Junichi A
This is an implementation of double-array structure for representing trie, as proposed by Junichi A...
SR-tree技术资料
📦 资源总数：352
📚 SR-tree全部资料 (352个)
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick tree
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick tree...
自己编的
自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。...
一个简单的Ext例子
一个简单的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 leng...
ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分
ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分，主要包括不同网络拓扑结构下ZigBee协议数据单元的路由方式、路由发现和路由维护等内容。为了达到低成本、低功耗、可靠性高等...
一个实现struts+spring+hebernate的例子
一个实现struts+spring+hebernate的例子，外加一个JavaScript实现的tree的都OK了。...
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access fr
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access fr...
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two...
) 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 huffma...