国产精品国产三级国产专区53,日韩欧美精品在线不卡,国产免费av国片精品草莓男男

balance-Bi-Tree

自己編的

自己編的，在VB中實現(xiàn)普里姆最小生成樹算法的代碼，有圖的，邊的權(quán)值是隨機生成的，5個節(jié)點，點“generate tree”，就會顯示出最小樹。

標簽：

上傳時間： 2017-04-09

上傳用戶：Andy123456
一個簡單的Ext例子

一個簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺的交互

標簽： Ext

上傳時間： 2013-12-23

上傳用戶：qweqweqwe
The W78E58B is an 8-bit microcontroller which has an in-system programmable Flash EPROM for firmwa

The W78E58B is an 8-bit microcontroller which has an in-system programmable Flash EPROM for firmware updating. The instruction set of the W78E58B is fully compatible with the standard 8052. The W78E58B contains a 32K bytes of main ROM and a 4K bytes of auxiliary ROM which allows the contents of the 32KB main ROM to be updated by the loader program located at the 4KB auxiliary ROM 512 bytes of on-chip RAM four 8-bit bi-directional and bit-addressable I/O ports an additional 4- bit port P4 three 16-bit timer/counters a serial port. These peripherals are supported by a eight sources two-level interrupt capability. To facilitate programming and verification, the ROM inside the W78E58B allows the program memory to be programmed and read electronically. Once the code is confirmed, the user can protect the code for security

標簽： microcontroller programmable in-system W78E58B

上傳時間： 2017-04-27

上傳用戶：yiwen213
伸展樹

伸展樹，基本數(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.

標簽： 樹

上傳時間： 2017-05-07

上傳用戶：JIUSHICHEN
Bardzzo przydatny skrypt do nauki matlaba nie tylko dla pocz膮tkuj膮cych ale r貿(mào)wniez dla tych kt貿(mào)偶y ch

Bardzzo przydatny skrypt do nauki matlaba nie tylko dla pocz膮tkuj膮cych ale r貿(mào)wniez dla tych kt貿(mào)偶y chc膮 pog艂臋bi膰 swoj膮 wiedz臋

標簽： przydatny dla Bardzzo matlaba

上傳時間： 2017-05-13

上傳用戶：hakim
ZigBee路由協(xié)議指的是ZigBee規(guī)范中規(guī)定的與路由相關(guān)的功能和算法部分

ZigBee路由協(xié)議指的是ZigBee規(guī)范中規(guī)定的與路由相關(guān)的功能和算法部分，主要包括不同網(wǎng)絡(luò)拓撲結(jié)構(gòu)下ZigBee協(xié)議數(shù)據(jù)單元的路由方式、路由發(fā)現(xiàn)和路由維護等內(nèi)容。為了達到低成本、低功耗、可靠性高等設(shè)計目標，ZigBee網(wǎng)絡(luò)采用了Cluster-Tree與AODV路由相結(jié)合的路由算法。該包實現(xiàn)了ZIGBEE路由算法在NS2下的模擬

標簽： ZigBee 路由協(xié)議路由算法

上傳時間： 2017-05-14

上傳用戶：WMC_geophy
一個實現(xiàn)struts+spring+hebernate的例子

一個實現(xiàn)struts+spring+hebernate的例子，外加一個JavaScript實現(xiàn)的tree的都OK了。

標簽： hebernate struts spring

上傳時間： 2013-11-25

上傳用戶：skhlm
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 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.

標簽： telecommunication represent messages Huffman

上傳時間： 2013-12-22

上傳用戶：ztj182002
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 groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.

標簽： branch-and-strategy Salesperson Traveling solution

上傳時間： 2013-12-29

上傳用戶：璇珠官人
) 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 distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.

標簽： code Compression huffman provide

上傳時間： 2017-05-30

上傳用戶：yuchunhai1990

<rt id="wcowm"></rt><li id="wcowm"></li>