讀取XML信息，顯示在tree上。并且提供各種控制功能
上傳時(shí)間： 2013-12-19
上傳用戶：gououo
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 matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
標(biāo)簽： implementation double-array representing structure
上傳時(shí)間： 2013-12-10
上傳用戶：shinesyh
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
標(biāo)簽： distinct elements fenwick number
上傳時(shí)間： 2014-01-20
上傳用戶：lhw888
自己編的，在VB中實(shí)現(xiàn)普里姆最小生成樹算法的代碼，有圖的，邊的權(quán)值是隨機(jī)生成的，5個(gè)節(jié)點(diǎn)，點(diǎn)“generate tree”，就會(huì)顯示出最小樹。
標(biāo)簽：
上傳時(shí)間： 2017-04-09
上傳用戶：Andy123456
一個(gè)簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺(tái)的交互
標(biāo)簽： Ext
上傳時(shí)間： 2013-12-23
上傳用戶：qweqweqwe
模糊PID算法（C++） 溫度控制的一般控制算法，Kp,Ki,Kd,需根據(jù)具體的控制對(duì)象取合適的值
上傳時(shí)間： 2013-12-07
上傳用戶：alan-ee
伸展樹，基本數(shù)據(jù)結(jié)構(gòu)，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.
標(biāo)簽： 樹
上傳時(shí)間： 2017-05-07
上傳用戶：JIUSHICHEN
ZigBee路由協(xié)議指的是ZigBee規(guī)范中規(guī)定的與路由相關(guān)的功能和算法部分，主要包括不同網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)下ZigBee協(xié)議數(shù)據(jù)單元的路由方式、路由發(fā)現(xiàn)和路由維護(hù)等內(nèi)容。為了達(dá)到低成本、低功耗、可靠性高等設(shè)計(jì)目標(biāo)，ZigBee網(wǎng)絡(luò)采用了Cluster-Tree與AODV路由相結(jié)合的路由算法。該包實(shí)現(xiàn)了ZIGBEE路由算法在NS2下的模擬
標(biāo)簽： ZigBee 路由協(xié)議 路由 算法
上傳時(shí)間： 2017-05-14
上傳用戶：WMC_geophy
一個(gè)實(shí)現(xiàn)struts+spring+hebernate的例子，外加一個(gè)JavaScript實(shí)現(xiàn)的tree的都OK了。
標(biāo)簽： hebernate struts spring
上傳時(shí)間： 2013-11-25
上傳用戶：skhlm
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
標(biāo)簽： telecommunication represent messages Huffman
上傳時(shí)間： 2013-12-22
上傳用戶：ztj182002
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
